Image signature matching device

ABSTRACT

An image signature to be used for matching is generated by the following generation method. First, region features are extracted from respective sub-regions of a plurality of pairs of sub-regions in an image, and for each of the pairs of sub-regions, a difference value between the region features of two sub-regions forming a pair is quantized. Then, a collection of elements which are quantization values calculated for the respective pairs of sub-regions is used as an image signature to be used for discriminating the image. The image signature matching device specifies, from an image signature of a first image and an image signature of a second image generated by the above generating method, a margin region of each of the images. The image signature matching device matches the image signature of the first image and the image signature of the second image in such a manner that a weight of an element, in which at least one of two sub-regions forming a pair is included in the specified margin region, is reduced.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a National Stage of International Application No. PCT/JP2010/003672 filed Jun. 2, 2010, claiming priority based on Japanese Patent Application No. 2009-143352 filed Jun. 16, 2009 and Japanese Patent Application No. 2009-149893 filed Jun. 24, 2009, the contents of all of which are incorporated herein by reference in their entirety.

TECHNICAL FIELD

The present invention relates to devices for matching images using image signatures which are features for discriminating (determining the identity of) images.

BACKGROUND ART

Image signatures are image features for discriminating (determining the identity of) images. By comparing an image signature extracted from an image with an image signature extracted from another image, an identity scale (in general, referred to as similarity or distance) indicating a degree of the two images being identical can be calculated from a comparison result. Further, by comparing the calculated identity scale with a threshold, it is possible to determine whether or not the two images are identical. In this context, the meaning of “two images being identical” includes not only the case where the two images are identical at the level of image signals (pixel values of the pixels constituting the images), but also the case where one image is a duplicate image of the other by means of various alteration processes such as conversion of compression format of an image, conversion of size/aspect ratio of an image, adjustment of color tone of an image, various filtering processes (sharpening, smoothing, and the like) applied to an image, local processing (caption superimposition, cutout, and the like) applied to an image, and recapturing of an image. By using image signatures, as it is possible to detect duplication of an image or a moving image which is a collection of images, for example, image signatures are applicable to an illegal copy detection system for images or moving images.

Patent Document 1 describes an example of an image signature. FIG. 18 is an illustration showing a method of extracting an image signature described in Patent Document 1. This image signature is a feature vector in multiple dimensions (sixteen dimensions in FIG. 18). The method includes respectively calculating mean luminance values from thirty two pieces of rectangle regions 244 (among them, sixteen pieces of rectangle regions are shown in FIG. 18) at predetermined positions in an image 240, and calculating differences in mean luminance value between rectangle regions forming pairs (the paired rectangle regions are linked to each other with dotted lines 248 in FIG. 18), to thereby obtain a difference vector 250 in sixteen dimensions. With respect to the difference vector 250, a composite vector is generated by means of vector transformation, and a quantization index vector in sixteen dimensions, acquired by quantizing the respective dimensions of the composite vector, is used as an image signature.

PRIOR ART DOCUMENT Patent Document

-   Patent Document 1: Japanese Unexamined Patent Publication No.     8-500471

SUMMARY OF THE INVENTION Problems to be Solved by the Invention

In an image signature formed of a feature vector in a plurality of dimensions, as the amount of information held by the feature vector is larger (redundancy is smaller) as correlation between dimensions are smaller, such an image signature has high discrimination capability which is a degree of discriminating different images. In contrast, if correlation between dimensions in a feature vector is large, as the amount of information held by the feature vector is small (redundancy is large), the discrimination capability is low. It should be noted that correlation between dimensions is a degree of similarity occurring from the features of the dimensions, and mathematically, it is a value calculated as, if occurrence of a feature of each dimension is set as a probability variable, a correlation coefficient between probability variables or a mutual information amount, for example. As such, it is desirable that an image signature formed of a feature vector in a plurality of dimensions should be designed such that correlation between dimensions is small.

Image signals (pixel values of the pixels constituting an image) have correlation between local regions in the image. Generally, as the distance between local regions is shorter, the correlation is larger. In particular, in an image in which a specific image pattern appears repeatedly (particularly, in the case where the image pattern repeatedly appears in regular cycles) (for example, an image of windows of a building arranged in a grid pattern, see FIG. 19(A)) or in an image formed of a particular texture (see FIG. 19(B)), for example, correlation between local regions of the image is large.

[First Problem]

Regarding an image signature formed of a feature vector including features extracted from a plurality of local regions of the image, as described in Patent Document 1, as the shapes of the local regions for extracting the features are the same in each dimension (in the example of Patent Document 1, rectangle regions in the same shape) with respect to an image in which correlation between local regions in the image is large, correlation between the dimensions of the extracted features is large. As such, there is a first problem that discrimination capability of the image signature (feature vector) is low. It should be noted that the shapes are identical means that the regions are identical including their size and angle (tilt or orientation).

For example, the image signature as described in Patent Document 1 has low discrimination capability with respect to an image in which a specific image pattern appears repeatedly (see FIG. 19(A)) or in an image formed of a particular texture (see FIG. 19(B)).

[Second Problem]

A second problem of the image signature described in Patent Document 1 is that as the shapes of the regions of respective dimensions for calculating features (feature vector) are in the identical rectangle shape (including size and angle), there is a blind spot on frequencies where it is impossible to detect frequency components having a cycle which is the same as the length of a side of the rectangle or which is a fraction of the integer thereof. This is because that if an average of signal components of such a particular frequency is calculated within a region, the value becomes 0 regardless of the magnitude of the signal component, so that signals of such frequency component cannot be detected at all. More specifically, assuming that a frequency having the same cycle as the length of a side of the rectangle is f₀, components of a frequency nf₀ (n=1, 2, 3, . . . ) cannot be detected. As such, with respect to an image in which signals concentrate on direct current components and such frequency components, a mean value of the pixel values becomes the same as the direct current component, whereby there is no difference in values between regions. Consequently, the value of every feature extracted as a difference in mean pixel values between regions becomes 0, so that discrimination cannot be performed (discrimination capability is significantly lowered). Practically, as it is difficult to detect not only the components of the frequency nf₀ (n=1, 2, 3, . . . ) but also a certain nearby frequency regions, even if signals do not concentrate on the above-described particular frequency, signal components of such a frequency band cannot be used, whereby the discrimination capability is lowered. In order to alleviate this problem, it may be possible to increase the value of the frequency f₀ so as to decrease the signal electricity fallen into the frequency band which is difficult to be detected. However, increasing the value of the frequency f₀ means reducing the size of the region, leading to lowering of the robustness (a degree that a feature does not vary due to various alteration processes or noise) of the frequency. For example, if a region becomes smaller, the value of the feature largely varies with respect to minor positional shift, whereby the robustness of the feature is lowered. As described above, when using the identical rectangle regions, it is extremely difficult to secure the robustness while increasing the discrimination cap ability.

An object of the present invention is to provide an image signature matching device capable of solving the above described problem, that is, a problem that matching accuracy is lowered in matching using image signatures having low discrimination capability which is a degree of discriminating different images.

Means for Solving the Problems

According to an aspect to the present invention, an image signature matching device includes, a margin region specifying unit for specifying, from an image signature of a first image and an image signature of a second image, a margin region of each of the images, wherein the image signature of the first image and the image signature of the second image are generated by a generation method including, extracting region features from respective sub-regions of a plurality of pairs of sub-regions in an image; for each of the pairs of sub-regions, quantizing a difference value between the region features of two sub-regions forming a pair; and generating a collection of elements which are quantization values calculated for the respective pairs of sub-regions as an image signature to be used for discriminating the image, and also includes a matching unit for matching the image signature of the first image and the image signature of the second image in such a manner that a weight of an element, in which at least one of two sub-regions forming a pair is included in the specified margin region, is reduced.

Effects of the Invention

As the present invention is configured as described above, matching between a first image and a second image can be performed with high accuracy using image signatures having high discrimination capability which is a degree of discriminating different images. In particular, this advantageous effect is significantly achieved with respect to an image in which correlation between local regions thereof is high.

Further, according to the present invention, matching can be performed using image signatures in which the discrimination capability is not lowered with respect to an image having signals concentrating on a particular frequency.

Further, according to the present invention, as matching is performed by a method in which margin regions of the first image and the second image are specified and matching is performed in such a manner that a weight of an element, in which at least one of two sub-regions forming a pair is included in the specified margin region, is reduced, matching can be performed with higher accuracy. Further, as the margin regions are specified from the image signatures themselves, there is also an advantageous effect that a unit for separately specifying the margin regions is not necessary on the extraction side (extraction stage) of the image signature.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram showing a first embodiment of the present invention.

FIG. 2 is an illustration showing exemplary pairs of extraction regions for respective dimensions shown by each-dimension extraction information.

FIG. 3 is a block diagram showing an example of a comparison unit in the first embodiment of the present invention.

FIG. 4 is a block diagram showing another example of a comparison unit in the first embodiment of the present invention.

FIG. 5 is a flowchart showing a flow of the processing in the first embodiment of the present invention.

FIG. 6 is a block diagram showing the main part of a second embodiment of the present invention.

FIG. 7 is a flowchart showing a flow of the processing in the second embodiment of the present invention.

FIG. 8 is a block diagram showing a third embodiment of the present invention.

FIG. 9 is a table showing examples of region feature calculation methods for respective dimensions.

FIG. 10 is a flowchart showing a flow of the processing in the third embodiment of the present invention.

FIG. 11 is a block diagram showing a fourth embodiment of the present invention.

FIG. 12 is a table showing examples of comparison and quantization methods for respective dimensions.

FIG. 13 is a flowchart showing a flow of the processing in the fourth embodiment of the present invention.

FIG. 14-a is a table showing each-dimension extraction region information used in sixth and seventh embodiments of the present invention.

FIG. 14-b is a table showing each-dimension extraction region information used in the sixth and seventh embodiments of the present invention.

FIG. 14-c is a table showing each-dimension extraction region information used in the sixth and seventh embodiments of the present invention.

FIG. 14-d is a table showing each-dimension extraction region information used in the sixth and seventh embodiments of the present invention.

FIG. 14-e is a table showing each-dimension extraction region information used in the sixth and seventh embodiments of the present invention.

FIG. 14-f is a table showing each-dimension extraction region information used in the sixth and seventh embodiments of the present invention.

FIG. 14-g is a table showing each-dimension extraction region information used in the sixth and seventh embodiments of the present invention.

FIG. 14-h is a table showing each-dimension extraction region information used in the sixth and seventh embodiments of the present invention.

FIG. 14-i is a table showing each-dimension extraction region information used in the sixth and seventh embodiments of the present invention.

FIG. 14-j is a table showing each-dimension extraction region information used in the sixth and seventh embodiments of the present invention.

FIG. 15-a is a table showing each-dimension region feature calculation method information used in the sixth embodiment of the present invention.

FIG. 15-b is a table showing each-dimension region feature calculation method information used in the sixth embodiment of the present invention.

FIG. 15-c is a table showing each-dimension region feature calculation method information used in the sixth embodiment of the present invention.

FIG. 15-d is a table showing each-dimension region feature calculation method information used in the sixth embodiment of the present invention.

FIG. 15-e is a table showing each-dimension region feature calculation method information used in the sixth embodiment of the present invention.

FIG. 16-a is a table showing each-dimension region feature calculation method information used in the seventh embodiment of the present invention.

FIG. 16-b is a table showing each-dimension region feature calculation method information used in the seventh embodiment of the present invention.

FIG. 16-c is a table showing each-dimension region feature calculation method information used in the seventh embodiment of the present invention.

FIG. 16-d is a table showing each-dimension region feature calculation method information used in the seventh embodiment of the present invention.

FIG. 16-e is a table showing each-dimension region feature calculation method information used in the seventh embodiment of the present invention.

FIG. 17-a is a table showing each-dimension comparison and quantization method information used in the sixth and seventh embodiments of the present invention.

FIG. 17-b is a table showing each-dimension comparison and quantization method information used in the sixth and seventh embodiments of the present invention.

FIG. 17-c is a table showing each-dimension comparison and quantization method information used in the sixth and seventh embodiments of the present invention.

FIG. 17-d is a table showing each-dimension comparison and quantization method information used in the sixth and seventh embodiments of the present invention.

FIG. 17-e is a table showing each-dimension comparison and quantization method information used in the sixth and seventh embodiments of the present invention.

FIG. 18 is an illustration showing a method of extracting an image signature described in Patent Document 1.

FIG. 19 is an illustration showing examples of images in which correlation between local regions is large.

FIG. 20 is a block diagram showing a matching unit for matching quantization index vectors.

FIG. 21 is a flowchart showing an exemplary process performed by the matching unit for matching quantization index vectors.

FIG. 22 is a flowchart showing another exemplary process performed by the matching unit for matching quantization index vectors.

FIG. 23 is a flowchart showing still another exemplary process performed by the matching unit for matching quantization index vectors.

FIG. 24 is a table showing examples of indexes applied to 1024 pieces of blocks formed by dividing an image into 32 in a vertical direction and 32 in a horizontal direction.

FIG. 25-a is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in an eighth embodiment of the present invention.

FIG. 25-b is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the eighth embodiment of the present invention.

FIG. 25-c is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the eighth embodiment of the present invention.

FIG. 25-d is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the eighth embodiment of the present invention.

FIG. 25-e is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the eighth embodiment of the present invention.

FIG. 25-f is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the eighth embodiment of the present invention.

FIG. 25-g is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the eighth embodiment of the present invention.

FIG. 26 is a table showing a relation among a region type of each dimension, a dimension number, and an index corresponding to a threshold.

FIG. 27-a is an illustration showing an example of first and second extraction regions of a dimension of a region type a.

FIG. 27-b is an illustration showing an example of first and second extraction regions of a dimension of a region type b.

FIG. 27-c is an illustration showing an example of first and second extraction regions of a dimension of a region type c.

FIG. 27-d is an illustration showing an example of first and second extraction regions of a dimension of a region type d.

FIG. 27-e is an illustration showing an example of first and second extraction regions of a dimension of a region type e.

FIG. 27-f is an illustration showing an example of first and second extraction regions of a dimension of a region type f.

FIG. 27-g is an illustration showing an example of first and second extraction regions of a dimension of a region type g.

FIG. 28 is a block diagram showing the configuration of a second embodiment of a matching unit for matching quantization index vectors.

FIG. 29 is an illustration showing exemplary images in which margin regions (black bars) are added.

FIG. 30-a is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in a ninth embodiment of the present invention.

FIG. 30-b is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the ninth embodiment of the present invention.

FIG. 30-c is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the ninth embodiment of the present invention.

FIG. 30-d is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the ninth embodiment of the present invention.

FIG. 30-e is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the ninth embodiment of the present invention.

FIG. 30-f is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the ninth embodiment of the present invention.

FIG. 30-g is a table showing regions belonging to one type, among regions corresponding to the respective dimensions in the ninth embodiment of the present invention.

FIG. 31 is a table showing a relation among a region type of each dimension, a dimension number, and an index corresponding to a threshold.

FIG. 32 is a graph showing an example of a monotone nonincreasing function f(D).

FIG. 33 is a block diagram showing a fifth embodiment of the present invention.

FIG. 34 is a flowchart showing still another exemplary process performed by the matching unit for matching quantization index vectors.

FIG. 35 is a flowchart showing another exemplary process performed by the matching unit for matching quantization index vectors.

FIG. 36 is a block diagram showing the configuration of a third embodiment of a matching unit for matching quantization index vectors.

FIG. 37 is a flowchart showing an exemplary process performed by the third embodiment of the matching unit for matching quantization index vectors.

FIG. 38 is a flowchart showing another exemplary process performed by the third embodiment of the matching unit for matching quantization index vectors.

DESCRIPTION OF EMBODIMENTS First Embodiment

[Configuration of First Embodiment]

Next, a first embodiment of the present invention will be described in detail with reference to the drawings.

Referring to FIG. 1, an image signature extraction device according to the first embodiment of the present invention is a system for outputting, with respect to an input image, a feature vector (more specifically, a quantization index vector) formed of a plurality of dimensions, as an image signature. The image signature extraction device includes a dimension determination unit 1, an extraction region acquisition unit 2, a region feature calculation unit 3, and a comparison unit 4.

The dimension determination unit 1 determines a dimension of a feature vector to be extracted next, and supplies it to the extraction region acquisition unit 2. The dimension determination unit 1 sequentially supplies dimensions of the feature vector to be extracted, and the constituent elements after the extraction region acquisition unit 2 extract features corresponding to the supplied dimensions. For example, if a feature vector is formed of N dimensions, the dimension determination unit 1 may sequentially supply the 1^(st) dimension to the N^(th) dimension to the extraction region acquisition unit 2. The dimensions may be supplied in any order if all of the dimensions of the feature vector are supplied finally. It is also possible to supply a plurality of dimensions in parallel.

To the extraction region acquisition unit 2, each-dimension extraction region information is supplied as an input, besides the dimensions supplied from the dimension determination unit 1.

The each-dimension extraction region information is information indicating a predetermined pair of a first extraction region and a second extraction region for extracting the feature of a dimension, which is associated with each dimension of a feature vector. The first and second extraction regions have the following features as prerequisites.

[Prerequisites of First and Second Extraction Regions]

Prerequisites of the first and second extraction regions are that relative positions of a pair of extraction regions are different among the dimensions, and combinations of the shapes of the pair of extraction regions are different among the dimensions.

FIG. 2 shows an exemplary pair of extraction regions, satisfying the prerequisites, for each of the dimensions indicated by the each-dimension extraction information. Different from the extraction regions for an image signature shown in FIG. 18, combinations of the shapes of the pairs of extraction regions are different among the respective dimensions. Different in shape includes the same shapes of different angles (e.g., the second extraction region of the 1^(st) dimension and the first extraction region of the 7^(th) dimension in FIG. 2), and similar shapes of different sizes (e.g., the second extraction region of the 1^(st) dimension and the second extraction region of the 9^(th) dimension in FIG. 2). It should be noted that a minimum condition is that at least one dimension, in which a pair of extraction regions have a combination of different shapes, is included in all of the dimensions of a feature vector. It is desirable that a feature vector includes a larger number of dimensions having pairs of extraction regions in (a combination of) different shapes from each other. This is because as a feature vector includes a larger number of pairs of extraction regions in (a combination of) different shapes from each other, a larger number of correlations between dimensions become smaller in the feature vector, whereby the discrimination capability becomes higher. For example, the shapes of a pair extraction regions may be different from each other in every dimensions in a feature vector.

A first extraction region and a second extraction region in a dimension are not necessarily in the same shape as shown in the 9^(th) dimension of FIG. 2, but may be in different shapes as shown in other dimensions of FIG. 2. If the shapes of a first extraction region and a second extraction in each dimension are different, the correlation between the features extracted from the first extraction region and the second extraction region becomes smaller, whereby the discrimination capability becomes higher. As such, it is desirable. Further, in that case, as a possibility that the first extraction region and the second extraction region become blind spots for the same frequency at the same time is low, the discrimination capability becomes high.

The respective extraction regions may take any shapes. For example, any complicated shapes, such as the second extraction region of the 6^(th) dimension in FIG. 2, are also acceptable. If extraction regions are formed of a plurality of pixels of an image, a line segment and a curved line are also acceptable as show in the 7^(th) dimension and the 10^(th) dimensions in FIG. 2. Further, an extraction region may consist of a plurality of discontinuous small regions, as the first extraction region of the 8^(th) dimension, the first and second extraction regions of the 11^(th) dimension, and the first extraction region of the 12^(th) dimension. As described above, if a feature vector includes extraction regions in complicated shapes, correlation between the dimensions of the features extracted therefrom can be lowered, whereby the discrimination capability can be higher.

Further, it is also possible that portions of a first extraction region and a second extraction region overlap each other, as in the 5^(th) dimension of FIG. 2. Further, either one of a pair of extraction regions may be included in the other one. As described above, by allowing overlapping of a pair of extraction regions, as a larger number of patterns (relative position, distance) can be taken for pairs of extraction regions, patterns enabling to reduce the correlation between dimensions can be increased, whereby the possibility of improving the discrimination capability is increased.

Further, portions of extraction regions may overlap each other between dimensions as the respective dimensions shown in FIG. 2, different from the extraction regions for the image signature shown in FIG. 18. If extraction regions are taken exclusively between dimensions as shown in the extraction regions for the image signature shown in FIG. 18, possible patterns of pairs of extraction regions are limited. By allowing overlapping of extraction regions between dimensions as shown in FIG. 2, it is possible to increase patterns enabling to reduce the correlation between dimensions, whereby the possibility of improving the discrimination capability is increased. However, if there are too many overlapped portions of extract regions between dimensions, correlation between dimensions becomes large so that the discrimination capability becomes low. As such, it is not desirable.

Further, between dimensions (pair of dimensions) in which the extraction regions are close to each other, it is desirable that the combinations of the shapes of the pairs of extraction regions in such dimensions (pair of dimensions) are different from each other. For example, between dimensions (pair of dimensions) in which the extraction regions are close to each other, the combinations of the shapes of the pairs of extraction regions in such dimensions (pair of dimensions) may be different from each other. In that case, between all dimensions (pairs of dimensions) in which the extraction regions are close to each other, the combinations of the shapes of the pairs of extraction regions in those dimensions may be different from each other. It is also possible that among the dimensions (pairs of dimensions) in which the extraction regions are close to each other, the combinations of the shapes of the pairs of extraction regions may be different from each other in the dimensions (pairs of dimensions) of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the extraction regions are close to each other, the combinations of the shapes of the pairs of extraction regions may be different from each other in at least one pair of dimensions.

It should be noted that a pair of dimensions in which the extraction regions are close to each other means a pair of dimensions in which the distance between the extraction regions (first extraction region and second extraction region) of the two dimensions, calculated by a predetermined method, is smaller than a predetermined threshold. The distance between the extraction regions (first extraction region and second extraction region) of two dimensions may be calculated as, for example, a mean value of the distances between all pixels included in the extraction regions (first extraction region and second extraction region) of the respective dimensions. The distance may also be calculated as, for example, a minimum value of the distances between all pixels included in the extraction regions (first extraction region and second extraction region) of the respective dimensions. It is also possible to calculate the center-of-gravity coordinates of the extraction regions (center-of-gravity coordinate of the first extraction region and the center-of-gravity coordinate of the second extraction region) of the respective dimensions, and calculate the distances between them (four distances are calculated in total), and then define the distance between the extraction regions of the two dimensions as a mean value or a minimum value thereof, for example. However, methods of calculating the distance between the extraction regions of two dimensions are not limited to these calculation methods.

With the combinations of the shapes of the pairs of extraction regions being different from each other between dimensions (pairs of dimensions) in which the extraction regions are close to each other, the following advantageous effect can be achieved. Between dimensions in which the extraction regions are close to each other, correlation between the extracted features tends to be large. If the combinations of the shapes of the pairs of extraction regions in those regions are the same, the correlation between the features is larger, whereby the redundancy in the entire feature vector becomes high, so that the discrimination capability is lowered. As such, by allowing the combinations of the shapes of the pairs of extraction regions to be different in those regions in order to offset the correlation between the extracted features becoming large due to the fact that the extraction regions are close to each other, the correlation between the features can be reduced, whereby the redundancy in the entire feature vector can be low, so that it is possible to prevent deterioration in the discrimination capability.

From an opposite point of view, between dimensions (pair of dimensions) in which the combinations of the shapes of the pairs of dimensions are the same, it is desirable that a distance between the extraction regions in those dimensions (pair of dimensions) is large. For example, between dimensions (pair of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the distance between such dimensions (pair of dimensions) may be larger than a predetermined threshold. In that case, between all dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the distances between those dimensions (pairs of dimensions) may be larger than a predetermined threshold. It is also possible that among the dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the distances between dimensions (pairs of dimensions) may be larger than a predetermined threshold in the dimensions (pairs of dimensions) of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the distance between dimensions (pairs of the dimensions) may be larger than a predetermined threshold in at least one pair of dimensions.

Further, between dimensions (pair of dimensions) in which the extraction regions are adjacent to each other, it is desirable that the combinations of the shapes of the pairs of extraction regions in such dimensions (pair of dimensions) are different from each other. It should be noted that dimensions (pair of dimensions) in which the extraction regions are adjacent means that partial peripheries of the extraction regions contact each other. For example, between dimensions (pair of dimensions) in which the extraction regions are adjacent, the combinations of the shapes of the pairs of extraction regions in such dimensions (pair of dimensions) may be different from each other. In that case, between all dimensions (pairs of dimensions) in which the extraction regions are adjacent, the combinations of the shapes of the pairs of extraction regions in those dimensions may be different from each other. It is also possible that among the dimensions (pairs of dimensions) in which the extraction regions are adjacent, the combinations of the shapes of the pairs of extraction regions may be different from each other in the dimensions (pairs of dimensions) in a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the extraction regions are adjacent, the combinations of the shapes of the pairs of extraction regions may be different from each other in at least one pair of dimensions.

With the combinations of the shapes of the pairs of extraction regions being different from each other between the dimensions (pairs of dimensions) in which the extraction regions are adjacent to each other, the following advantageous effect can be achieved. Between dimensions in which the extraction regions are adjacent, correlation between the extracted features tends to be large. This is because the distance between the extraction regions of the two dimensions is close between the dimensions in which the extraction regions are adjacent to each other (correlation is high between close regions within an image). If the combinations of the shapes of the pairs of extraction regions in those regions are the same, the correlation between the features is larger, whereby the redundancy in the entire feature vector becomes high, so that the discrimination capability is lowered. As such, by allowing the combinations of the shapes of the pairs of extraction regions to be different in those regions in order to offset the correlation between the extracted features becoming large due to the fact that the extraction regions are adjacent to each other, the correlation between the features can be reduced, whereby the redundancy in the entire feature vector can be low, so that it is possible to prevent deterioration in the discrimination capability.

From an opposite point of view, between dimensions (pair of dimensions) in which the combinations of the shapes of the pairs of dimensions are the same, it is desirable that the extraction regions in those dimensions (pair of dimensions) are not adjacent to each other. For example, between dimensions (pair of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the extraction regions in such dimensions (pair of dimensions) may not be adjacent. In that case, between all dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the extraction regions in those dimensions (pairs of dimensions) may not be adjacent. It is also possible that among the dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the extraction regions may not be adjacent in the dimensions (pairs of dimensions) of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the extraction regions may not be adjacent in at least one pair of dimensions.

Further, between dimensions (pair of dimensions) in which the extraction regions partially overlap, it is desirable that the combinations of the shapes of the pairs of extraction regions in such dimensions (pair of dimensions) are different from each other. For example, between dimensions (pair of dimensions) in which the extraction regions partially overlap, the combinations of the shapes of the pairs of extraction regions in such dimensions (pair of dimensions) may be different from each other. In that case, between all dimensions (pairs of dimensions) in which the extraction regions partially overlap, the combinations of the shapes of the pairs of extraction regions in those dimensions may be different from each other. It is also possible that among the dimensions (pairs of dimensions) in which the extraction regions partially overlap, the combinations of the shapes of the pairs of extraction regions may be different from each other in the dimensions (pairs of dimensions) of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the extraction regions partially overlap, the combinations of the shapes of the pairs of extraction regions may be different from each other in at least one pair of dimensions.

With the combinations of the shapes of the pairs of extraction regions being different from each other between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, the following advantageous effect can be achieved. Between dimensions in which the extraction regions partially overlap, correlation between the extracted features tends to be large. This is because between the dimensions in which the extraction regions partially overlap, the regions used for calculating the features are shared partially. If the combinations of the shapes of the pairs of extraction regions in those regions are the same, the correlation between the features is larger, whereby the redundancy in the entire feature vector becomes high, so that the discrimination capability is lowered. As such, by allowing the combinations of the shapes of the pairs of extraction regions to be different in those regions in order to offset the correlation between the extracted features becoming large due to the fact that the extraction regions partially overlap, the correlation between the features can be reduced, whereby the redundancy in the entire feature vector can be low, so that it is possible to prevent deterioration in the discrimination capability.

With the combinations of the shapes of the pairs of extraction regions being different from each other between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, another advantageous effect can be achieved. With the combinations of the shapes of the pairs of extraction regions being different from each other between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, there is an advantage that tolerance against falsification (particularly, malicious falsification) of an image can be enhanced. Malicious falsification to an image is conducted by changing the pixel value of a partial region of the image, for example, in an attempt to deteriorate accuracy in identity determination by the image signature (feature vector) extracted from the image. Between the dimensions in which the extraction regions are partially overlap, if the overlapped region of the image is falsified, that is, if the pixel value of the overlapped region is changed, the feature (region feature) extracted therefrom is affected, whereby it is highly likely that the feature may be different from the feature extracted from the region which was not falsified. If the combinations of the shapes of the pairs of extraction regions in those dimensions are the same, the features extracted from the extraction regions of the respective dimensions are affected in a similar manner, whereby the possibility that the features are changed at the same time would be high, so that the robustness is low. If the combinations of the shapes of the pairs of extraction regions in those dimensions are different, even if the overlapped region is falsified, the possibility that the features are affected in a similar manner so that the features are changed at the same time can be reduced, whereby the robustness can be secured. As such, it becomes difficult to falsify the overlapped region by changing the features of a plurality of dimensions sharing the overlapped region at the same time. Accordingly, with the combinations of the shapes of the pairs of extraction regions being different from each other between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, tolerance against falsification (particularly, malicious falsification) in an image can be enhanced.

From an opposite point of view, between dimensions (pair of dimensions) in which the combinations of the shapes of the pairs of dimensions are the same, it is desirable that the extraction regions in those dimensions (pair of dimensions) do not overlap each other. For example, between dimensions (pair of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the extraction regions in such dimensions (pair of dimensions) may not overlap each other. In that case, between all dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the extraction regions in those dimensions (pairs of dimensions) may not overlap each other. It is also possible that among the dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the extraction regions may not overlap each other in the dimensions (pairs of dimensions) of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the extraction regions may not overlap each other in at least one pair of dimensions.

Further, it is desirable that extraction regions are taken such that the region from which features are not extracted is small (which means almost all of the screen image can be covered) when the extraction regions for all dimensions are combined. If the region from which features are not extracted is large as in the case of FIG. 18, a large portion of the information included in the image signal (pixel values of the pixels constituting the image) is not used, so that the discrimination capability is not high. By taking extraction regions such that the region from which features are not extracted is small (which means almost all of the screen image can be covered) when the extraction regions for all dimensions are combined, a larger portion of the information included in the image signal can be reflected on the features, whereby the discrimination capability can be high. Further, it is desirable that extraction features are not biased but obtained uniformly from the entire image, when the extraction regions for all dimensions are combined. However, if the probability of performing local processing such as caption superimposition on a specific region is high, it is desirable to obtain extraction regions while avoiding such a region. Further, generally, as regions around the edge of an image often do not include feature portions of the image, it is desirable to obtain extraction regions while avoiding such surrounding regions.

Furthermore, it is desirable that the size and the relative position (distance, direction) of the extraction regions follow certain distribution (uniform distribution, for example), because if the relative position (distance, direction) follows the uniform distribution, the extraction region are not biased with respect to the distance or direction whereby the extraction regions do not concentrate on a particular distance or direction, whereby a wider variety can be achieved. Further, as the correlation between regions is larger as the relative positions are close, in order to offset such an effect, it is desirable that the difference in shape is larger as the relative positions are closer.

The each-dimension extraction region information may be in any form if a first extraction region and a second extraction region for each dimension can be uniquely specified with the information. Further, as an extraction region must always be the same region with respect to an image of any size or aspect ratio, the each-dimension extraction region information should be in a form which can obtain the same extraction region with respect to an image of any size or aspect ratio. For example, the each-region extraction region may describe the position and the shape of an extraction region with respect to an image having a predetermined size and aspect ratio (for example, an image having a horizontal width of 320 pixels×a vertical width of 240 pixels). In that case, with respect to an image input with an arbitrary size and aspect ratio, resizing the image first to have the predetermined size and aspect ratio and then specifying the extraction region in accordance with the position and the shape of the extraction region described in the each-dimension extraction region information. In contrast, it is also possible to convert the position and the shape of the extraction region described in the each-dimension extraction region information corresponding to the image of any size and aspect ratio of the input image to thereby specify the extraction region.

The information indicating each extraction region included in the each-dimension extraction region information may be information describing a collection of coordinate values of all pixels constituting the extraction region with respect to an image of a predetermined size and aspect ratio (for example, an image having a horizontal width of 320 pixels×a vertical width of 240 pixels). Further, the information indicating each extraction region included in the each-dimension extraction region information may be information describing, with parameters, the position and the shape of the extraction region with respect to an image of a predetermined size and aspect ratio. For example, if the shape of the extraction region is a quadrangle, the information may describe the coordinate values of the four corners of the quadrangle. Further, if the shape of the extraction region is a circle, the information may describe the coordinate values of the center and the radius value of the circle.

Further, it is also possible to adopt a method of generating, with use of a seed of pseudo random numbers as an each-dimension extraction region information, pseudo random numbers by starting from the seed inside the extraction region acquisition unit 2 to thereby generate extraction regions in different shapes according to the random numbers (for example, the four corners of a quadrangle are determined according to the random numbers). Specifically, an each-dimension extraction region can be acquired according to the following procedure.

(1) A seed of pseudo random numbers is supplied as each-dimension extraction region information.

(2) A dimension n is set to be n=1

(3) Pseudo random numbers are generated, and the four corners of a quadrangle of a first extraction region for the dimension n are determined.

(4) Pseudo random numbers are generated, and the four corners of a quadrangle of a second extraction region for the dimension n are determined.

(5) A dimension n is set to be n+1, and the procedure returns to (3).

As the extraction regions are determined based on the random numbers, the generated extraction regions are different from each other for respective dimensions. Further, if the seed of the pseudo random numbers is the same, as the same random numbers are generated each time (with respect to any images), the same extraction regions are reproduced for different images.

The extraction region acquisition unit 2 acquires, from the each-dimension extraction region information supplied as an input, information indicating the first extraction region and the second extraction region corresponding to the dimension supplied from the dimension determination unit 1, and outputs the information to the extraction region representative value calculation unit 3.

To the region feature calculation unit 3, an image which is an extraction target for an image signature is supplied as an input, besides the input from the extraction region acquisition unit 2 (information indicating the first extraction region and the second extraction region). The region feature calculation unit 3 includes a first region feature calculation unit 31 and a second region feature calculation unit 32. With use of the first region feature calculation unit 31, the region feature calculation unit 3 calculates, from the image supplied as an input, a feature of the first extraction region as a first region feature for each dimension based on the information indicating the first extraction region supplied from the extraction region acquisition unit 2, and supplies the feature to the comparison unit 4. Further, with use of the second region feature calculation unit 32, the region feature calculation unit 3 calculates, from the image supplied as an input, a feature of the second extraction region as a second region feature for each dimension based on the information indicating the second extraction region supplied from the extraction region acquisition unit 2, and supplies the feature to the comparison unit 4.

It should be noted that in order to specify the respective extraction regions with respect to the input image based on the information indicating the first extraction region and the second extraction region, the region feature calculation unit 2 resizes the image to have a predetermined size and aspect ratio in the each-dimension extraction region information, if necessary.

The region feature calculation unit 3 calculates region features of the respective extraction regions using the pixel values of a group of pixels included in the respective extraction regions. In this embodiment, a pixel value is a value of a signal held by each pixel of the image, which is a scalar quantity or a vector quantity. For example, if the image is a luminance image, a pixel value is a luminance value (scalar quantity), and if the image is a color image, a pixel value is a vector quantity indicating a color component. If the color image is an RGB image, a pixel value is a three-dimensional vector quantity of an R component, a G component, and a B component. Further, if the color image is a YCbCr image, a pixel value is a three-dimensional vector quantity of a Y component, a Cb component, and a Cr component.

For calculating the region features of the extraction regions, any methods can be used if a method of calculating the extraction regions (first extraction region and the second extraction region) of the dimension is constant (the same calculation method is used for any input images).

Further, the region feature to be calculated may be a scalar quantity or a vector quantity. For example, if a pixel value is a scalar quantity such as a luminance value, the region feature may be calculated as a mean value, a median value, a mode value, a maximum value, a minimum value, or the like (each of them is a scalar quantity). Further, it is also possible to sort pixel values included in an extraction region, and obtain a pixel value at a predetermined proportional position from the top or the bottom of the distribution (sorted order) as a region feature (which is also a scalar quantity), for example. More specifically, explanation will be given for the case where P % of the percentage (e.g., P=25%) is the predetermined proportion. Pixel values (luminance values) of the total N pieces of pixels included in an extraction region are sorted in ascending order, and a collection of the pixel values (luminance values) sorted in ascending order is indicated as Y(i)={Y(0), Y(1), Y(2), . . . , Y(N−1)}. In this example, a pixel value at a position of P % from the bottom of the permutation sorted in ascending order is Y(floor(N*P/100)) for example, so this value is obtained as a region feature of the extraction region. It should be noted that floor( ) is a function in which after the decimal point is truncated. In this example, a region feature calculated by applying this formula (Y(floor(N*P/100))) with respect to the luminance value of the pixel included in the extraction region is referred to as a “percentile luminance value feature”.

Further, if the pixel value is a vector quantity such as a color component, it is possible to first convert the value into a scalar quantity by means of any method, and then calculate a region feature by the above-described method. For example, if the pixel value is a three-dimensional vector quantity of RGB components, it is possible to first convert the value into a luminance value which is a scalar quantity, and then calculate a region feature by the above-described method. Further, if the pixel value is a vector quantity, it is also possible to use a mean vector of the pixel values included in the extraction region as a region feature.

Further, it is also possible to perform any operation (differential operation, filtering operation) such as edge detection or template matching with respect to an extraction region, and use the operation result as a region feature. For example, it may be a two-dimensional vector quantity indicating the edge direction (gradient direction), or a scalar quantity indicating the similarity with a template.

Further, a histogram showing the color distribution, edge direction distribution, or edge intensity distribution, included in the extraction region, may be obtained as a region feature (each of them is a vector quantity).

Further, any of the various types of features defined in ISO/IEC 15938-3 may be used, which include dominant color, color layout, scalable color, color structure, edge histogram, homogeneous texture, texture browsing, region shape, contour shape, shape 3D, parametric motion, and motion activity.

The comparison unit 4 compares the first region feature with the second region feature supplied from the region feature calculation unit 3 for each dimension, and quantizes the comparison result to output the acquired quantization index. As the comparison unit 4 outputs quantization indexes for the respective dimensions, a quantization index vector consisting of the quantization indexes of a plurality of dimensions is finally output.

The comparison unit 4 may use any methods to compare a first region feature with a second region feature and perform quantization. Also, the number of quantization indexes for each dimension is also arbitrary.

If the region features are scalar quantities (e.g., mean values of luminance values) for example, the comparison unit 4 may compare their magnitudes, and if the first region feature is larger, set the quantization index to be +1, and in other cases, sets the quantization index to be −1, so as to quantize the comparison result into two values of quantization indexes of +1 and −1. In should be noted that regarding a dimension n, if the first region feature is Vn1 and the second region feature is Vn2, a quantization index Qn of the dimension n can be calculated by the following expression. Qn=+1(if Vn1>Vn2) −1(if Vn1≦Vn2)  [Expression 1]

FIG. 3 shows a more detailed configuration diagram of the comparison unit 4 when the comparison unit 4 performs comparison and quantization based on the above Expression 1.

Referring to FIG. 3, the comparison unit 4 includes a magnitude comparison unit 41 and a quantization unit 42.

When the first region feature and the second region features are supplied, the magnitude comparison unit 41 compares the value of a first region feature with the value of the second region feature, and supplies the comparison result to the quantization unit 42. This means that the magnitude comparison unit 41 compares the magnitude of Vn1 with that of Vn2, and supplies information indicating whether the comparison result is Vn1>Vn2 or Vn1≦Vn2 to the quantization unit 42 as a magnitude comparison result.

Based on the magnitude comparison result supplied from the magnitude comparison unit 41, the quantization unit 42 performs quantization according to Expression 1, and outputs a quantization index. As such, the quantization unit 42 outputs a quantization index in such a manner that if information indicating that the comparison result is Vn1>Vn2 is supplied, a quantization index is +1, while if information indicating that the comparison result is Vn1≦Vn2 is supplied, an quantization index is −1.

It should be noted that the comparison and quantization method according to Expression 1 is hereinafter referred to as a comparison and quantization method A.

Further, if the region feature is a scalar volume (e.g., a mean value of luminance values), the comparison unit 4 may perform quantization in such a manner that if the absolute value of the difference value is smaller than or equal to a predetermined threshold, it is determined that there is no difference between the first region feature and the second region feature so that a quantization index 0 indicating no difference is set, and in other cases, the comparison unit 4 compares their magnitude and if the first region feature is larger, a quantization index +1 is set, while in other cases, a quantization index −1 is set, whereby the quantization index is in any of three values of +1, 0, and −1. Assuming that the first region feature of a dimension n is Vn1 and the second region feature thereof is Vn2 and a predetermined threshold is th, a quantization index Qn of the dimension n can be calculated from the following expression. Qn=+1(if |Vn1−Vn2|>th and Vn1>Vn2) 0(if |Vn1−Vn2|≦th) −1(if |Vn1−Vn2|>th and Vn1≦Vn2)  [Expression 2]

FIG. 4 shows a more detailed configuration diagram of the comparison unit 4 when the comparison unit 4 performs comparison and quantization according to Expression 2.

Referring to FIG. 4, the comparison unit 4 includes a difference value calculation unit 43 and a quantization unit 44. To the quantization unit 44, a threshold which is predetermined information indicating the boundary of quantization (quantization boundary information) is supplied beforehand as an input.

When the first region feature and the second region feature are supplied, the difference value calculation unit 43 calculates a difference value between the value of the first region feature and the value of the second region feature, and supplies the calculated difference value to the quantization unit 44. This means that the difference value calculation unit 43 calculates Vn1−Vn2, and supplies the resultant value to the quantization unit 44.

The quantization unit 44 performs quantization according to Expression 2 based on the difference value supplied from the difference value calculation unit 43 and a threshold which is information indicating the predetermined boundary of quantization (quantization boundary information) supplied as an input, and outputs a quantization index. This means that the quantization unit 42 outputs a quantization index based on the value of Vn1−Vn2 supplied from the difference value calculation unit 41 and the threshold th supplied as an index, in such a manner that if |Vn1−Vn2|>th and Vn1−Vn2>0, the quantization index is +1, if |Vn1−Vn2|>th and Vn1−Vn2≦0, the quantization value is −1, and if |Vn1−Vn2|≦th, the quantization index is 0.

The comparison and quantization method based on Expression 2 is hereinafter referred to as a comparison and quantization method B.

Although quantization is performed in three values based on the difference value in this example, it is possible to perform quantization in a larger number of (levels of) quantization indexes according to the magnitude of the difference value. Even in that case, the comparison unit 4 has the configuration as shown in FIG. 4, and to the quantization unit 44, a plurality of thresholds as information indicating the predetermined boundaries of quantization for respective levels (quantization boundary information) are supplied as inputs. A comparison and quantization method for quantization into four or more levels, based on this difference value and the thresholds supplied as inputs, is hereinafter referred to as a comparison and quantization method C.

As described above, by introducing a quantization index indicating there is no difference for the case where the difference between the first region feature and the second region feature is small (smaller than or equal to a predetermined threshold) so that it is determined that no difference exists, it is possible to make the feature (quantization index) in a dimension of a pair of extraction regions having a small difference between the region features more stable, that is, more robust with respect to various alteration process and noise, compared with the method according to Expression 1. As such, it is possible to output an image signature (quantization index vector) which is stable with respect to an image having less difference between local regions in whole, that is, an flat image having less variations in whole (e.g., an image of blue sky), and is robust with respect to various alteration processes and noise.

Further, if the region feature is a vector quantity, for example, the comparison unit 4 may first convert the vector quantity into a scalar quantity by means of any arbitrary method, and then perform quantization by the above-described method (this comparison and quantization method is hereinafter referred to as a comparison and quantization method D). It is also possible to calculate a difference vector, which is a difference from the vector of a second extraction region, from the vector of a first extraction region, and quantize the difference vector to thereby obtain a quantization index, for example. In that case, representative vectors (center of gravity vectors, etc) predetermined for respective quantization indexes are supplied, and are classified into quantization indexes having the largest similarity (smallest distance) between the representative vectors and the difference vectors (this comparison and quantization method is hereinafter referred to as a comparison and quantization method E). Further, similar to the quantization of a scalar quantity according to the above-described Expression 2, if a norm of the difference vector is smaller than or equal to a predetermined threshold, it is possible to determine that there is no difference between the first region feature and the second region feature to thereby introduce a quantization index indicating no difference as a quantization index 0 which indicates no difference.

(A) It should be noted that when matching quantization index vectors output in the present invention (when comparing a quantization index vector extracted from an image with a quantization index vector extracted from another image to determine whether or not they are identical), the number of dimensions in which quantization indexes conform (similarity) or the number of dimensions in which quantization indexes do not conform (Hamming distance) may be calculated as an identity scale, which is compared with a threshold, whereby the identity of the images can be determined.

(B) Further, if the quantization indexes are calculated based on Expression 2 in the comparison unit 4, an identity scale (similarity) can be calculated as follows. First, quantization index vectors of two images are compared with each other between corresponding dimensions, and the number of dimensions in which not “both quantization indexes are 0” is calculated (this value is set to be A). Next, in the dimensions in which not “both quantization indexes are 0”, the number of dimensions in which the quantization indexes conform is calculated (this value is set to be B). Then, a similarity is calculated as B/A. If A=0 (that is if both quantization indexes are 0 in every dimensions), the similarity is set to be a predetermined numerical value (e.g., 0.5).

(C) It is also possible to calculate the number of dimensions (this value is set to be C) in which quantization indexes do not conform in the dimensions in which not “both quantization indexes are 0”, to thereby calculate the identity scale (distance) as C/A. If A=0 (that is if both quantization indexes are 0 in every dimension), the identity scale (distance) is set to be a predetermined numerical value (e.g., 0.5). An advantageous effect of the method of calculating the identity scale as C/A is shown below, compared with the method of calculating the identity scale as B/A. As B+C=A, there is no difference in the accuracy of identity determination of images between the case of calculating B (the number of dimensions in which quantization indexes conform) to obtain B/A and the case of calculating C (the number of dimensions in which quantization indexes do not conform) to obtain C/A (because B/A=1−C/A and C/A=1−B/A, so the only difference between them is that B/A calculates the identity scale as “similarity” while C/A calculates the identity scale as “distance”). However, when determining identity by comparing the calculated identity scale with a threshold which has been given beforehand, a difference in the calculation cost is generated between the two methods if calculation of a similarity scale is terminated in order to reduce the calculation costs. Calculation of a similarity scale is terminated as follows. A threshold for identity determination has been given beforehand. For respective dimensions, it is sequentially determined whether quantization indexes {conform•do not conform} with each other, and the value of the number of dimensions in which the quantization indexes {conform•do not conform} with each other is calculated (incremented), and the value is sequentially compared with the threshold. As the point when the number of dimensions in which the quantization indexes {conform•do not conform} with each other exceeds the threshold, calculation may be terminated (because it is obvious that the value exceeds the threshold even if the calculation are continued). It should be noted that in general, a threshold for identity determination is set to be a value larger than 0.5 (a half) if the identity scale (similarity) is calculated as B/A, or set to be a value smaller than 0.5 (a half) if the identity scale (distance) is calculated as C/A (in the former case, the images are determined to be identical if the calculated value is larger than the threshold, while in the latter case, the images are determined to be identical if the calculated value is smaller than the threshold). For example, a threshold is set to be 0.8 when B/A is calculated, and a threshold is set to be 0.2 when C/A is calculated. If A=100, in the case of calculating B/A, the value of B is sequentially calculated and when the value of B exceeds 80, calculation may be terminated. In the case of calculating C/A, the value of C is sequentially calculated and when the value of C exceeds 20, calculation may be terminated. This means that while calculation cannot be terminated until the value exceeds 80 in the case of calculating B, calculation can be terminated when the value exceeds 20 in the case of calculating C. As such, as calculation can be terminated at an earlier point when calculating an identity scale as C/A rather than calculating it as B/A, calculating an identity scale as C/A has an advantageous effect of reducing the calculation cost.

(D) Further, it is also possible to calculate the number of dimensions in which “both quantization indexes are 0” as D (if the total number of dimensions is N, A+D=N) to thereby calculate the identity scale as B/f(D) or C/f(D) using any monotone nonincreasing function f(D) of D. A monotone nonincreasing function f(D) of D is a function in which f(D1)≧f(D2) is satisfied with respect to D1<D2. FIG. 32 is a graph showing an example of f(D) with respect to D (horizontal axis indicates D and vertical axis indicates f(D)). In FIG. 32, the function (i), where f(D)=constant, delivers an identity scale having the same value as that simply calculated as B or C, and the function (ii), where f(D)=N−D=A, delivers an identity scale having the same value as that calculated as B/A or C/A. It should be noted that f(D) is not necessarily in a linear shape with respect to D as the function (i) or the function (ii), and as long as it is a monotone nonincreasing function of D, it may be a function in a non-linear shape as the function (iii) or the function (iv). Advantageous effects of calculating an identity scale as B/f(D) or C/f(D) using any monotone nonincreasing function of D, as described above, will be provided below. Referring to Expression 2, the quantization index 0 indicates that there is no difference between the values of region features of two extraction regions (smaller than or equal to the threshold). In a flat image region in which variations are small as a whole, that is, a difference between features of local regions is small (a sky region, a white wall region, or the like), the number of quantization indexes 0 is likely to be large (for example, in an image of a blue sky which is flat as a whole, quantization index will be 0 in almost all dimensions), and further, as such a flat image region is included in many images, it appears that dimensions in which the quantization index is 0 have low effectiveness in determining identity by comparing quantization index vectors of two images. In the quantization index vectors of the two compared images, it is considered that the dimensions where “both quantization indexes are 0” are dimensions which are less effective in determining the identity by comparing the quantization index vectors of the two images. In B and C, dimensions of low effectiveness in which “both quantization indexes are 0” are eliminated so as to limit to dimensions of high effectiveness in which not “both quantization indexes are 0” to thereby calculate the number of dimensions in which quantization indexes conform (B) or the number of dimensions in which quantization indexes do not conform (C). By eliminating dimensions of low effectiveness so as to limit to dimensions of high effectiveness to thereby calculate an identity scale, it is possible to realize highly accurate matching for determining identity of the images. Further, f(D) normalizes the value of B or C according to the number of dimensions in which “both quantization indexes are 0”, that is, the number of dimensions of low effectiveness (as D is larger, A is smaller, so that the value of B or C becomes smaller, whereby normalization is performed with respect to D by a monotone nonincreasing function). It should be noted that as any monotone nonincreasing function is used as a function for normalization, it is possible to adjust (control) behavior of the identity scale, providing an advantageous effect that optimization can be achieved according to the image databases or applications on which identity determination is performed.

(E) In the method of calculating an identity scale described in the previous paragraph (paragraph D), eliminating dimensions of low effectiveness in which “both quantization indexes are 0” and limiting to dimensions of high effectiveness in which not “both quantization indexes are 0” to thereby calculate an identity scale. However, it is also possible not to completely eliminate dimensions of low effectiveness in which “both quantization indexes are 0” but use monotone nondecreasing function g(D) with respect to D which is the number of dimensions in which “both quantization indexes are 0” so as to calculate the identity scale as (B/f(D))+g(D). It should be noted that the first term B/f(D) is an identity scale calculated from the dimensions of high effectiveness in which not “both quantization indexes are 0” and the latter term g(D) is an identity scale calculated from the dimensions of low effectiveness in which “both quantization indexes are 0”, and the entire identity scale is defined as the sum thereof. By designing the monotone nondecreasing function g(D) such that the effect (weight) of the latter term g(D) becomes smaller than that of the first term B/f(D), an identity scale can be calculated such that the weight of the first term B/f(D) having high effectiveness is large. For example, it is possible to use a small weighting value β to calculate an identity scale as (B/f(D))+β*D. Further, when f(D)=constant, if 1/f(D)=α, an identity scale may be calculated as α*B+β*D. As described above, by calculating an identity scale by separating dimensions of high effectiveness in which not “both quantization indexes are 0” and dimensions of low effectiveness in which “both quantization indexes are 0”, it is possible to adjust (control) the relative weights of the dimensions of high effectiveness and the dimensions of low effectiveness (for example, increasing the weight of the dimensions of high effectiveness) while considering the entire dimensions. This provides an advantageous effect such that optimization can be performed according to the image databases or applications on which identity determination is performed.

(F) It should be noted that in paragraphs (B)-(E), although the method of calculating an identity scale has been described based on the (number of) dimensions in which “both quantization indexes are 0” and the (number of) dimensions in which not “both quantization indexes are 0” in the two quantization index vectors to be compared, it is possible to calculate an identity scale by means of a similar calculation method based on the (number of) dimensions in which “either one of quantization indexes is 0” and the (number of) dimensions in which “either one of quantization indexes is not 0”. This means that the (number of) dimensions in which “both quantization indexes are 0” and the (number of) dimensions in which not “both quantization indexes are 0” in paragraphs (B)-(E) may be replaced with the (number of) dimensions in which “either one of quantization indexes is 0” and the (number of) dimensions in which “either one of quantization indexes is not 0”, respectively.

(G) Although the matching method (identity scale calculation method), described in paragraphs (B)-(F), has been described based on the premise that the quantization indexes are calculated based on Expression 2, the matching method is not limited to the case where the quantization indexes are calculated based on Expression 2. If a quantization method of introducing quantization indexes indicating that there is no difference (difference is small, that is, smaller than or equal to a predetermined threshold) between a first region feature and a second region feature which are features of the two extraction regions (first extraction region and second extraction region) in the comparison unit 4, such a matching method may be applicable. As such, the quantization index 0 in paragraphs (B)-(F) should be understood as a “quantization index indicating that there is no difference (difference is small, that is, smaller than or equal to a predetermined threshold) between a first region feature and a second region feature.

(H) If a means for calculating an identity scale by a method of matching quantization indexes extracted from two images, described in paragraphs (A)-(G), is a matching means, it is possible to configure an image signature matching device including the matching means as a constituent element. The matching unit compares a quantization index vector of a first image with a quantization index vector of a second image, output from the comparison unit 4, and calculates the identity scale and outputs it. Further, the image signature matching device may include an identity determination unit in addition to the matching unit. The identity determination unit compares the magnitude of the identity scale supplied from the matching unit with a given threshold, determines whether or not the first image and the second image are identical, and outputs the determination result.

(I) It should be noted that the method of matching quantization index vectors, described in paragraphs (A)-(H), may be applicable to all of the embodiments (second embodiment, third embodiment, fourth embodiment, and other embodiments) described below.

[Operation of First Embodiment]

Next, operation of the image signature extraction device according to the first embodiment will be described with reference to the flowchart of FIG. 5. In the flowchart of FIG. 5, a dimension (number) of a feature vector is indicated by “n”, and there are N dimensions in total from 1 to N.

First, the dimension determination unit 1 determines a dimension 1 as the first dimension (n=1) for extracting a feature vector, and supplies it to the extraction region acquisition unit 2 (step A1).

Next, the extraction region acquisition unit 2 acquires information indicating a first extraction region and a second extraction region of the dimension n from each-dimension extraction region information supplied as an input, and supplies it to the region feature calculation unit 3 (step A2).

Then, the region feature calculation unit 3 calculates a first region feature and a second region feature of the dimension n from the image supplied as an input, and supplies the features to the comparison unit 4 (step A3).

Then, the comparison unit 4 compares the first region feature with the second region feature of the dimension n, quantizes the comparison result, and outputs a quantization index (step A4).

Then, it is determined whether or not output of quantization indexes for all dimensions has been completed (that is, it is determined whether n<N is true or false) (step A5). If output of quantization indexes for all dimensions has been completed (that is, if n<N is false), the processing ends. If output of quantization indexes for all dimensions has not been completed (that is, if n<N is true), the processing proceeds to step A6. At step A6, the dimension determination unit 1 determines the next dimension for extracting a feature vector (n=n+1), and supplies it to the extraction region acquisition unit 2. Then, the processing returns to step A2.

It should be noted that although the extraction processing is performed in order from the dimension 1 to the dimension N, any order may be taken without being limited to this order. Further, it is also possible to perform the extraction processing for a plurality of dimensions in parallel, without limiting to the above processing procedure.

[Effects of First Embodiment]

Next, advantageous effects of the first embodiment of the present invention will be described.

A first advantageous effect is that the discrimination capability, which is a degree of discriminating different images, of an image signature constituted of feature vectors of a plurality of dimensions can be improved. In particular, this effect is significant with respect to an image having large correlation between local regions of the image.

This is because as the shapes of the regions for extracting the features are different among the dimensions (the shapes of the regions are variable), correlation among the dimensions can be reduced.

A second advantageous effect is that a discrimination capability will not be degraded with respect to an image in which signals concentrate on a particular frequency.

This is because as the shapes of the regions for extracting the features are different among the dimensions (the shapes of the regions are variable), even with respect to an image in which signals concentrate on a particular frequency, a case where there is no difference between features of all (many) pairs of extraction regions (dimensions) at the same time so that the discrimination capability is deteriorated, is less caused.

Second Embodiment

[Configuration of Second Embodiment]

Next, a second embodiment of the present invention will be described in detail with reference to the drawings.

The second embodiment of the present invention differs from the first embodiment in that the comparison unit 4 of the first embodiment shown in FIG. 1 is replaced with a comparison unit 4A shown in FIG. 6 in detail. As the components other than the comparison unit 4A are the same as those of the first embodiment, the description of those components is omitted in this embodiment.

Referring to FIG. 6, the comparison unit 4A includes a difference value calculation unit 43, a quantization boundary determination unit 45, and a quantization unit 44.

The difference value calculation unit calculates a difference value between a first region feature and a second region feature supplied from the region feature calculation unit 3 for each dimension, and supplies the difference value to the quantization boundary determination unit 45 and the quantization unit 44.

If the region features are scalar quantities (e.g., a mean value of luminance values), the difference value is a scalar quantity obtained by subtracting the second region feature from the first region feature (or vice versa), for example. If the region features are vector quantities, it is also possible to obtain a difference value of scalar quantities after converting the respective vectors into scalar quantities by means of an arbitrary method. Further, if the region features are vector quantities, it is possible to use a difference vector between the first region feature and the second region feature as a difference value (vector quantity).

When the difference values for all dimensions of the feature vector, supplied from the difference value calculation unit 43, are supplied to the quantization boundary determination unit 45, the quantization boundary determination unit 45 determines the boundary of quantization based on the distribution of the difference values of all dimensions, and supplies information regarding the determined quantization boundary to the quantization unit 44. It should be noted that distribution of the difference values of all dimensions means frequency (probability) of occurrence with respect to the difference values (or the difference vector).

Further, determination of the boundary of quantization means determination of parameters to be assigned to the quantization indexes exclusively without fail, when quantizing the difference values. If the difference value is a scalar quantity, a value range (that is, a threshold) with respect to each quantization index (quantization level) is determined, and such a value range (threshold) is supplied to the quantization unit 43 as information of the quantization boundary, for example. Alternatively, if the difference value is a vector quantity, a parameter for performing vector quantization for example, that is, a representative vector of the respective quantization indexes, for example, is determined and supplied to the quantization unit 44 as information of the quantization boundary.

If the difference value is a scalar quantity and quantization of M value (M=2, 3, . . . etc.) is to be performed, the quantization boundary determination unit 45 may determine the value range (threshold) for quantization based on the distribution of the difference values of all dimensions such that the proportions of the respective quantization indexes, with respect to all dimension, become equal.

For example, as a variation of Expression 1, in the case of performing quantization in 2 values (M=2) using a constant α where the quantization index is +1 if Vn1+α>Vn2 while the quantization index is −1 if Vn1+α≦Vn, the center point of the distribution of the difference values (the point where the integral values of left and right distributions become equal) may be determined to be a threshold α of the quantization such that the proportions of quantization indexes +1 and quantization indexes −1 become equal. Similarly, when performing quantization in M values if the difference values are vector quantities, it is possible to determine regions of the vector space assigned to the respective quantization indexes or determine a representative vector (e.g., center of gravity vector) of the respective quantization indexes when performing vector quantization, such that the proportions of the respective quantization indexes with respect to all dimensions become equal, based on the distribution of the difference vectors of all dimensions. As described above, by allowing the proportions of quantization indexes with respect to all dimensions to be equal (that is, eliminating bias of quantization indexes), the entropy can be increased, so that the identification capability can be improved.

A comparison and quantization method, in which the quantization boundary determination unit 45 determines the boundary of quantization such that the proportions of the quantization indexes with respect to all dimensions become equal and the quantization unit 44 performs quantization based on the determined boundary, is hereinafter referred to as a comparison and quantization method F.

(J) Further, if the difference value is a scalar quantity and quantization is performed in three values (quantization indexes are +1, 0, −1) by means of Expression 2, for example, the quantization boundary determination unit 45 may determine a threshold th used for quantization to an quantization index 0 indicating no difference (quantization index is set to be 0 if smaller than or equal to this threshold) based on the distribution of difference values of all dimension, and supply the determined threshold th to the quantization unit 44 (in the comparison unit 4 shown in FIG. 4 of the first embodiment, the threshold th has been set beforehand). For example, the quantization boundary determination unit 45 may calculate absolute values of the difference values of all dimensions, sort the calculated values, and set a point at a predetermined proportion from the top or the bottom (such a predetermined proportion is supplied as an input, for example) to be the threshold th (this comparison and quantization method is hereinafter referred to as a comparison and quantization method G). Further, it is also possible to determine the threshold th not by a predetermined proportion but by a manner by which the proportions of quantization indexes of +1, 0, −1 become close to equal (this comparison and quantization method is hereinafter referred to as a comparison and quantization method H). The comparison and quantization method H corresponds to a specific example of the comparison and quantization method F performed in accordance with Expression 2.

A more specific method of the comparison and quantization method G will be explained with an example where the predetermined percentage is P % (e.g., P=25%). The absolute values of the difference values of all dimensions (the number of dimensions=N) are sorted in ascending order, and a collection of the absolute values, sorted in ascending order, of the difference values is indicated as D(i)={D(0), D(1), D(2), . . . D(N−1)}. In this example, the value at a position of P % from the bottom of the order sorted in an ascending manner is D(floor(N*P/100)) for example, and the threshold th=D(floor(N*P/100)). It should be noted that floor( )) is a function in which the places after the decimal point are truncated.

The method in the present embodiment can be compared with the case where the comparison unit 4 takes the configuration shown in FIG. 4, as in the first embodiment. While a predetermined threshold th is supplied as an input in the configuration shown in FIG. 4 of the first embodiment, in the above-described method of the second embodiment, the quantization boundary determination unit 45 calculates a threshold th adaptively with respect to the image, based on the distribution of the difference values of all dimensions. As described above, while the threshold th is fixed in the first embodiment, the threshold th is calculated adaptively with respect to the image in the second embodiment. As the threshold th is calculated adaptively with respect to the image, it is possible to prevent the values of the dimensions of a feature vector from being biased to particular quantization indexes (probability of appearance of particular quantization indexes is high) compared with the case where the threshold th is fixed (particularly with respect to an image having less relief), the discrimination capability can be higher. For example, in the case of using a fixed threshold th as in the first embodiment, quantization indexes become 0 in most of the dimensions (or all of the dimensions) of a feature vector in the image of less relief. However, if an adaptive threshold th of the second embodiment is used, as the threshold is automatically adjusted to a small value with respect to an image having less relief, the case where quantization indexes become 0 in most of the dimensions of the feature vector will not be caused.

The quantization unit 44 performs quantization based on the difference values of the respective dimensions supplied from the difference value calculation unit 43 and the information of the quantization boundary supplied from the quantization boundary determination unit 45, and outputs quantization indexes.

It should be noted that the quantization unit 44 must follow the quantization method which has been expected when the quantization boundary determination unit 45 determined the quantization boundary, because there is no point if the quantization unit 44 performs quantization without taking into account the quantization boundary information output from the quantization boundary determination unit 45.

[Operation of Second Embodiment]

Next, operation of the image signature extraction device according to the second embodiment will be described with reference to the flowchart of FIG. 7. In the flowchart of FIG. 7, a dimension (number) of a feature vector is indicated by “n”, and there are N dimensions in total from 1 to N.

First, the dimension determination unit 1 determines a dimension 1 as the first dimension (n=1) for extracting a feature vector, and supplies it to the extraction region acquisition unit 2 (step B1).

Next, the extraction region acquisition unit 2 acquires information indicating a first extraction region and a second extraction region of the dimension n from each-dimension extraction region information supplied as an input, and supplies the information to the region feature representative value calculation unit 3 (step B2).

Then, the region feature representative value calculation unit 3 calculates a first region feature and a second region feature of the dimension n from the image supplied as an input, and supplies the features to the difference value calculation unit 43 (step B3).

Then, the difference value calculation unit 43 calculates a difference value between the first region feature and the second region feature of the dimension n, and supplies the difference value to the quantization boundary determination unit 45 and the quantization unit 44 (step B4).

Then, it is determined whether or not the processing up to calculation of the difference values for all dimensions has been completed (that is, it is determined whether n<N is true or false) (step B5). If the processing up to calculation of the difference values for all dimensions has been completed (that is, if n<N is false), the processing proceeds to step B7. If the processing up to calculation of the difference values for all dimensions has not been completed (that is, if n<N is true), the processing proceeds to step B6. At step B6, the dimension determination unit 1 determines the next dimension for extracting a feature vector (n=n+1), and supplies it to the extraction region acquisition unit 2. Then, the processing returns to step B2.

It should be noted that although the extraction processing is performed in order from the dimension 1 to the dimension N in this embodiment, any order may be taken without being limited to this order.

Then, when the difference values for all dimensions of the feature vector supplied from the difference value calculation unit 43 have been supplied, the quantization boundary determination unit 45 determines the boundary of quantization based on the distribution of the difference values of the all dimensions, and supplies the determined quantization boundary information to the quantization unit 44 (step B7).

Then, at step B8, dimension 1 is set (n=1) as the first dimension for performing quantization (quantization indexes are calculated).

Then, the quantization unit 44 performs quantization based on the difference value of the dimension n and the quantization boundary supplied from the quantization boundary determination unit 45, and outputs a quantization index (step B9).

Then, it is determined whether or not output of the quantization indexes for all dimensions has been completed (that is, it is determined whether n<N is true or false) (step B10). If output of the quantization indexes for all dimensions has been completed (that is, if n<N is false), the processing ends. If output of the quantization indexes for all dimensions has not been completed (that is, if n<N is true), the processing proceeds to step B11. At step B11, as a dimension of a feature vector for performing quantization, the next dimension is set (n=n+1). Then, the processing returns to step B9.

It should be noted that although the extraction processing is performed in order from the dimension 1 to the dimension N in this embodiment, any order may be taken without being limited to this order.

[Effects of Second Embodiment]

Compares with the first embodiment in which the boundary of quantization is fixed, the second embodiment is different in that the boundary of quantization is calculated adaptively (dynamically) with respect to an image. If the boundary of quantization is fixed as in the first embodiment, there is a case where the values of the dimensions of a feature vector are biased to particular quantization indexes (probability of appearance of particular quantization indexes is high) with respect to a particular image (e.g., a flat image having less relief) (entropy is low), causing a problem that the discrimination capability is deteriorated with respect to such an image. On the other hand, if the boundary of quantization is adaptively (dynamically) calculated with respect to an image as in the second embodiment, as it is possible to prevent the case where the values of the dimensions of a feature vector is biased to particular quantization indexes (probability of appearance of particular quantization indexes is high) with respect to any images, the discrimination capability can be improved.

Third Embodiment

[Configuration of Third Embodiment]

Next, a third embodiment of the present invention will be described in detail with reference to the drawings.

Referring to FIG. 8, the configuration of the third embodiment of the present invention is different from that of the first embodiment shown in FIG. 1 in that a region feature calculation method acquisition unit 5 is added, and the region feature calculation unit 3 is replaced with a region feature calculation unit 3A including a first region feature calculation unit 31A and a second region feature calculation unit 32A. As the other components are the same as those of the first embodiment, the explanation thereof is omitted in this embodiment. It should be noted that although a combination with the first embodiment is described in this embodiment, a combination with the second embodiment is also acceptable.

To the region feature calculation method acquisition unit 5, a dimension from the dimension determination unit 1 and each-dimension region feature calculation method information are supplied.

The each-dimension region feature calculation method information is information indicating a method of calculating a region feature in a dimension, which is associated with each dimension of a feature vector, and a prerequisite is that region feature calculation methods must be different among the dimensions. It should be noted that region feature calculation methods being different includes applying different parameters (threshold or the like) to the identical procedure.

In this embodiment, region feature calculation methods include various types of methods described in the explanation of the region feature calculation unit 3 of the first embodiment, and the parameters associated thereto.

It should be noted that the region feature calculation method for each dimension indicated by the each-dimension region feature calculation method information has a minimum condition such that at least one pair of dimensions in which the region feature calculation methods are different should be included in the all dimensions of the feature vector. It is desirable that the number of dimensions in which region feature calculation methods are different is larger, because as the number of such dimensions is larger, the number of dimensions having small correlation between them is larger in the feature vector, whereby the discrimination capability is higher. For example, the region feature calculation methods may be different in all dimensions in the feature vector.

It should be noted that the information showing the region feature calculation method for each dimension may take any form, if the method of calculating the region feature is uniquely specified.

FIG. 9 shows examples of the region feature calculation methods for respective dimensions. As shown in FIG. 9, the region feature calculation methods are different among the dimensions. Further, as shown in the examples of FIG. 9, features of scalar quantities and vector quantities may be mixed (the 1^(st), 3^(rd), 5^(th), 6^(th), 8^(th), 9^(th), 10^(th), and 12^(th) dimensions are scalar quantities and 2^(nd), 4^(th), 7^(th), and the 11^(th) dimensions are vector quantities).

Further, between dimensions (pair of dimensions) in which the extraction regions are close to each other, it is desirable that the region feature calculation methods in such dimensions (pair of dimensions) are different from each other. For example, between dimensions (pair of dimensions) in which the extraction regions are close to each other, the region feature calculation methods in such dimensions (pair of dimensions) may be different from each other. In that case, between all dimensions (pairs of dimensions) in which the extraction regions are close to each other, the region feature calculation methods in those dimensions may be different from each other. It is also possible that among the dimensions (pairs of dimensions) in which the extraction regions are close to each other, the region feature calculation methods may be different from each other in the dimensions (pairs of dimensions) of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the extraction regions are close to each other, the region feature calculation methods may be different from each other in at least one pair of dimensions.

It should be noted that a pair of dimensions in which the extraction regions are close to each other means a pair of dimensions in which a distance between the extraction regions (first extraction region and second extraction region) of the two dimensions, calculated by a predetermined method, is smaller than a predetermined threshold. The distance between the extraction regions (first extraction region and second extraction region) of two dimensions may be calculated as, for example, a mean value of the distances between all pixels included in the extraction regions (first extraction region and second extraction region) of the respective dimensions. The distance may also be calculated as, for example, a minimum value of the distances between all pixels included in the extraction regions (first extraction region and second extraction region) of the respective dimensions. It is also possible to calculate center-of-gravity coordinates of the extraction regions (center-of-gravity coordinate of the first extraction region and the center-of-gravity coordinate of the second extraction region) of the respective dimensions, and calculate the distances between them (four distances are calculated in total), and then define the distance between the extraction regions of the two dimensions as a mean value or a minimum value thereof, for example. However, methods of calculating the distance between the extraction regions of two dimensions are not limited to these calculation methods.

With the region feature calculation methods being different from each other between the dimensions (pairs of dimensions) in which the extraction regions are close to each other, the following advantageous effect can be achieved. Between dimensions in which the extraction regions are close to each other, correlation between the extracted features tends to be large. If the region feature calculation methods in those regions are the same, the correlation between the features is larger, whereby the redundancy in the entire feature vector becomes high, so that the discrimination capability is lowered. As such, by allowing the region feature calculation methods to be different in those regions in order to offset the correlation between the extracted features becoming large due to the fact that the extraction regions are close to each other, the correlation between the features can be reduced, whereby the redundancy in the entire feature vector can be low, so that it is possible to prevent deterioration in the discrimination capability.

From an opposite point of view, between dimensions (pair of dimensions) in which the region feature calculation methods are the same, it is desirable that a distance between the extraction regions in those dimensions (pair of dimensions) is large. For example, between dimensions (pair of dimensions) in which the region feature calculation methods are the same, the distance between such dimensions (pair of dimensions) may be larger than a predetermined threshold. In that case, between all dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the distances between those dimensions (pairs of dimensions) may be larger than a predetermined threshold. It is also possible that among the dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the distances between dimensions (pairs of dimensions) may be larger than a predetermined threshold in the dimensions of a predetermined proportion or larger, or the distance between the pairs of the extraction regions may be larger than a predetermined threshold in at least one pair of dimensions.

Further, between dimensions (pair of dimensions) in which the extraction regions are adjacent to each other, it is desirable that the region feature calculation methods in such dimensions (pair of dimensions) are different from each other. It should be noted that dimensions (pair of dimensions) in which the extraction regions are adjacent means that partial peripheries of the extraction regions contact each other. For example, between dimensions (pair of dimensions) in which the extraction regions are adjacent, the region feature calculation methods in such dimensions (pair of dimensions) may be different from each other. In that case, between all dimensions (pairs of dimensions) in which the extraction regions are adjacent, the region feature calculation methods in those dimensions may be different from each other. It is also possible that among the dimensions (pairs of dimensions) in which the extraction regions are adjacent, the region feature calculation methods may be different from each other in the dimensions (pairs of dimensions) in a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the extraction regions are adjacent, the region feature calculation methods may be different from each other in at least one pair of dimensions.

With the region feature calculation methods being different from each other between the dimensions (pairs of dimensions) in which the extraction regions are adjacent to each other, the following advantageous effect can be achieved. Between dimensions in which the extraction regions are adjacent, correlation between the extracted features tends to be large. This is because the distance between the extraction regions of the two dimensions is close between the dimensions in which the extraction regions are adjacent (correlation is high between close regions within an image). If the region feature calculation methods in those regions are the same, the correlation between the features is larger, whereby the redundancy in the entire feature vector becomes high, so that the discrimination capability is lowered. As such, by allowing the region feature calculation methods to be different in those regions in order to offset the correlation between the extracted features becoming large due to the fact that the extraction regions are adjacent, the correlation between the features can be reduced, whereby the redundancy in the entire feature vector can be low, so that it is possible to prevent deterioration in the discrimination capability.

From an opposite point of view, between dimensions (pair of dimensions) in which the region feature calculation methods are the same, it is desirable that the extraction regions in those dimensions (pair of dimensions) are not adjacent to each other. For example, between dimensions (pair of dimensions) in which the region feature calculation methods are the same, the extraction regions in such dimensions (pair of dimensions) may not be adjacent. In that case, between all dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the extraction regions in those dimensions (pairs of dimensions) may not be adjacent. It is also possible that among the dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the extraction regions may not be adjacent in the dimensions (pairs of dimensions) in a predetermined proportion or larger, or the extraction regions may not be adjacent in at least one pair of dimensions.

Further, between dimensions (pair of dimensions) in which the extraction regions partially overlap, it is desirable that the region feature calculation methods in such dimensions (pair of dimensions) are different from each other. For example, between dimensions (pair of dimensions) in which the extraction regions partially overlap, the region feature calculation methods in such dimensions (pair of dimensions) may be different from each other. In that case, between all dimensions (pairs of dimensions) in which the extraction regions partially overlap, the region feature calculation methods in those dimensions may be different from each other. It is also possible that among the dimensions (pairs of dimensions) in which the extraction regions partially overlap, the region feature calculation methods may be different from each other in the dimensions (pairs of dimensions) in a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the extraction regions partially overlap, the region feature calculation methods may be different from each other in at least one pair of dimensions.

With the region feature calculation methods being different from each other between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, the following advantageous effect can be achieved. Between dimensions in which the extraction regions partially overlap, correlation between the extracted features tends to be large. This is because between the dimensions in which the extraction regions partially overlap, the regions used for calculating the features are shared partially. If the region feature calculation methods in those regions are the same, the correlation between the features is larger, whereby the redundancy as the entire feature vector becomes high, so that the discrimination capability is lowered. As such, by allowing the region feature calculation methods to be different in those regions in order to offset the correlation between the extracted features becoming large due to the fact that the extraction regions partially overlap, the correlation between the features can be reduced, whereby the redundancy in the entire feature vector can be low, so that it is possible to prevent deterioration in the discrimination capability.

With the region feature calculation methods being different from each other between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, another advantageous effect can be achieved. With the region feature calculation methods being different from each other between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, there is an advantage that tolerance against falsification (particularly, malicious falsification) of an image can be enhanced. Malicious falsification to an image is conducted by changing the pixel value of a partial region of the image, for example, in an attempt to deteriorate accuracy in identity determination by the image signature (feature vector) extracted from the image. Between the dimensions in which the extraction regions are partially overlap, if the overlapped region of the image is falsified, that is, if the pixel value of the overlapped region is changed, the feature (region feature) extracted therefrom is affected, whereby it is highly likely that the feature may be different from the feature extracted from the region which was not falsified. If the region feature calculation methods in those dimensions are the same, the features extracted from the extraction regions of the respective dimensions are affected in a similar manner, whereby the possibility that the features are changed at the same time would be high, so that the robustness is low. If the region feature calculation methods in those dimensions are different, even if the overlapped region is falsified, the possibility that the features are affected in a similar manner so that the features are changed at the same time can be reduced, whereby the robustness can be secured. As such, it becomes difficult to falsify the overlapped region by changing the features of a plurality of dimensions sharing the overlapped region at the same time. Accordingly, with the region feature calculation methods being different from each other between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, tolerance against falsification (particularly, malicious falsification) in an image can be enhanced.

From an opposite point of view, between dimensions (pair of dimensions) in which the region feature calculation methods are the same, it is desirable that the extraction regions in those dimensions (pair of dimensions) do not overlap each other. For example, between dimensions (pair of dimensions) in which the region feature calculation methods are the same, the extraction regions in such dimensions (pair of dimensions) may not overlap each other. In that case, between all dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the extraction regions in those dimensions (pairs of dimensions) may not overlap each other. It is also possible that among the dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the extraction regions may not overlap each other in the dimensions (pairs of dimensions) of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the extraction regions may not overlap each other in at least one pair of dimensions.

From a similar point of view, between dimensions (pair of dimensions) in which the region feature calculation methods are the same, it is desirable that the combinations of the shapes of the pairs of extraction regions are different. Further, between dimensions (pair of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, it is desirable that the region feature calculation methods are different. For example, between dimensions (pair of dimensions) in which the region feature calculation methods are the same, the combinations of the shapes of the pairs of extraction regions may be different. Further, between dimensions (pair of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the region feature calculation methods may be different. In that case, between all dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the combinations of the shapes of the pairs of extraction regions may be different. Further, between all dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the region feature calculation methods may be different. It is also possible that among the dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the combinations of the shapes of the pairs of extraction regions may be different in the dimensions of a predetermined proportion or larger. Further, it is also possible that among the dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the region feature calculation methods may be different in the dimensions of a predetermined proportion or larger. It is also possible that among the dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the combinations of the shapes of the pairs of extraction regions may be different in at least one pair of dimensions. Further, it is also possible that among the dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the region feature calculation methods may be different in at least one pair of dimensions.

The region feature calculation method acquisition unit 5 acquires, from the each-dimension region feature calculation method information supplied as an input, information indicating the region feature calculation method associated with the dimension supplied from the dimension determination unit 1, and supplies the information to the region feature calculation unit 3A.

The region feature calculation unit 3A calculates, based on information indicating a first extraction region and a second extraction region supplied from the extraction region acquisition unit for each dimension, a feature of the first extraction region and a feature of the second extraction region as a first region feature and a second region feature, respectively, from the image supplied as an input, according to the information indicating the region feature calculation method supplied from the region feature calculation method acquisition unit 5, and supplies the features to the comparison unit 4.

In the region feature calculation unit 3A, it is necessary that the dimension of the information indicating the extraction region to be supplied and the dimension of the information indicating the region feature calculation method are synchronized.

[Operation of Third Embodiment]

Next, with reference to the flowchart of FIG. 10, operation of the image signature extraction device according to the third embodiment will be described. In the flowchart of FIG. 10, a dimension (number) of a feature vector is indicated by “n”, and there are N dimensions in total from 1 to N.

First, the dimension determination unit 1 determines a dimension 1 as the first dimension (n=1) for extracting a feature vector, and supplies it to the extraction region acquisition unit 2 and the region feature calculation method acquisition unit 5 (step C1). Next, the extraction region acquisition unit 2 acquires information indicating a first extraction region and a second extraction region of the dimension n from each-dimension extraction region information supplied as an input, and supplies the information to the region feature calculation unit 3A (step C2).

Then, the region feature calculation method acquisition unit 5 acquires information indicating the region feature calculation method corresponding to the dimension n from the each-dimension region feature calculation method information supplied as an input, and supplies the information to the region feature calculation unit 3A (step C3).

Then, the region feature calculation unit 3A calculates a first region feature and a second region feature of the dimension n from the image supplied as an input, and supplies the features to the comparison unit 4 (step C4). Then, the comparison unit 4 compares the first region feature with the second region feature of the dimension n, quantizes the comparison result, and outputs a quantization index (step C5). Then, it is determined whether or not output of the quantization indexes for all dimensions has been completed (step C6). If output of the quantization indexes for all dimensions has been completed, the processing ends. If output of the quantization indexes for all dimensions has not been completed, the processing proceeds to step C7. At step C7, the dimension determination unit 1 determines the next dimension for extracting a feature vector (n=n+1), and supplies it to the extraction region acquisition unit 2 and the region feature calculation method acquisition unit 5. Then, the processing returns to step C2.

It should be noted that although the extraction processing is performed in order from the dimension 1 to the dimension N in this embodiment, any order may be taken without being limited to this order. Further, it is also possible to perform the extraction processing for a plurality of dimensions in parallel, without limiting to such processing procedures. Further, step C2 and step C3 may be in reverse order.

[Effect of Third Embodiment]

In addition to the advantageous effects of the first embodiment, the third embodiment has an advantageous effect that the discrimination capability which is a degree of discriminating different images can be further improved.

This is because as the region feature calculation methods are different among the dimensions (variable region feature calculation methods are used), correlation among dimensions can be small.

Fourth Embodiment

[Configuration of Fourth Embodiment]

Next, a fourth embodiment of the present invention will be described in detail with reference to the drawings.

Referring to FIG. 11, the configuration of the fourth embodiment of the present invention is different from that of the first embodiment shown in FIG. 1 in that a comparison method acquisition unit 6 is added, and the comparison unit 4 is replaced with a comparison unit 4B. As the other components are the same as those of the first embodiment, the explanation thereof is omitted in this embodiment. It should be noted that although a combination with the first embodiment is described in this embodiment, a combination with the second embodiment and a combination with the third embodiment are also acceptable.

To the comparison unit acquisition unit 6, a dimension from the dimension determination unit 1 and each-dimension comparison method information are supplied.

The each-dimension comparison and quantization method information is information indicating a method of comparing region features in a dimension which is associated with each dimension of a feature vector and performing quantization, and a prerequisite is that comparison and quantization methods must be different among the dimensions. It should be noted that comparison and quantization methods being different includes applying different parameters (threshold, quantization index number, or the like) to the identical procedure.

In this embodiment, comparison and quantization methods include various types of comparison and quantization methods described in the explanation of the comparison unit 4 of the first embodiment, and the parameters associated thereto (threshold, the number of quantization indexes, or the like), and various types of comparison and quantization methods described in the explanation of the comparison unit 4A of the second embodiment, and the parameters associated thereto (threshold, the number of quantization indexes, or the like).

It should be noted that the comparison and quantization method for each dimension indicated by the each-dimension comparison and quantization method information has a minimum condition that at least one pair of dimensions in which the comparison and quantization method is different should be included in the all dimensions of the feature vector. It is desirable that the number of dimensions in which comparison and quantization methods are different is larger, because as the number of such dimensions is larger, the number of dimensions having small correlation between them is larger in the feature vector, whereby the discrimination capability becomes higher. For example, the comparison and quantization methods may be different in all dimensions in the feature vector.

It should be noted that the information showing the comparison and quantization method for each dimension may take any form if the method of comparing and quantizing the region feature is uniquely specified.

FIG. 12 shows examples of the comparison and quantization methods for respective dimensions. As shown in FIG. 12, comparison and quantization methods are different among the dimensions. Further, different parameters (thresholds th) may be set in the same comparison and quantization methods as in the 3^(rd), 5^(th), and 12^(th) dimensions. It should be noted that the examples of comparison and quantization methods for the respective dimensions shown in FIG. 12 are associated with the region feature calculation methods for the respective dimensions shown in FIG. 9. As such, comparison and quantization methods for scalar quantities are shown as examples for the region features of scalar quantities, and comparison and quantization methods for vector quantities are shown as examples for the region features of vector quantities.

Further, between dimensions (pair of dimensions) in which the extraction regions are close to each other, it is desirable that the comparison and quantization methods in such dimensions (pair of dimensions) are different from each other. For example, between dimensions (pair of dimensions) in which the extraction regions are close to each other, the comparison and quantization methods in such dimensions (pair of dimensions) may be different from each other. In that case, between all dimensions (pairs of dimensions) in which the extraction regions are close to each other, the comparison and quantization methods in those dimensions may be different from each other. It is also possible that among the dimensions (pairs of dimensions) in which the extraction regions are close to each other, the comparison and quantization methods may be different from each other in the dimensions (pairs of dimensions) of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the extraction regions are close to each other, the comparison and quantization methods may be different from each other in at least one pair of dimensions.

It should be noted that a pair of dimensions in which the extraction regions are close to each other means a pair of dimensions in which a distance between the extraction regions (first extraction region and second extraction region) of the two dimensions, calculated by a predetermined method, is smaller than a predetermined threshold. The distance between the extraction regions (first extraction region and second extraction region) of two dimensions may be calculated as, for example, a mean value of the distances between all pixels included in the extraction regions (first extraction region and second extraction region) of the respective dimensions. The distance may also be calculated as, for example, a minimum value of the distances between all pixels included in the extraction regions (first extraction region and second extraction region) of the respective dimensions. It is also possible to calculate center-of-gravity coordinates of the extraction regions (center-of-gravity coordinate of the first extraction region and the center-of-gravity coordinate of the second extraction region) of the respective dimensions, and calculate the distances between them (four distances are calculated in total), and then define the distance between the extraction regions of the two dimensions as a mean value or a minimum value thereof, for example. However, methods of calculating the distance between the extraction regions of two dimensions are not limited to these calculation methods.

With the comparison and quantization methods being different from each other between the dimensions (pairs of dimensions) in which the extraction regions are close to each other, the following advantageous effect can be achieved. Between dimensions in which the extraction regions are close to each other, correlation between the extracted features tends to be large. If the comparison and quantization methods in those regions are the same, the correlation between the features is larger, whereby the redundancy as the entire feature vector becomes high, so that the discrimination capability is lowered. As such, by using different comparison and quantization methods in those regions in order to offset the correlation between the extracted features becoming large due to the fact that the extraction regions are close to each other, the correlation between the features can be reduced, whereby the redundancy as the entire feature vector can be low, so that it is possible to prevent deterioration in the discrimination capability.

From an opposite point of view, between dimensions (pair of dimensions) in which the comparison and quantization methods are the same, it is desirable that a distance between the extraction regions in those dimensions (pair of dimensions) is large. For example, between dimensions (pair of dimensions) in which the comparison and quantization methods are the same, the distance between such dimensions (pair of dimensions) may be larger than a predetermined threshold. In that case, between all dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the distances between those dimensions (pairs of dimensions) may be larger than a predetermined threshold. It is also possible that among the dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the distances between dimensions (pairs of dimensions) may be larger than a predetermined threshold in the dimensions of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the distance between dimensions (pairs of dimension) may be larger than a predetermined threshold in at least one pair of dimensions.

Further, between dimensions (pair of dimensions) in which the extraction regions are adjacent to each other, it is desirable that the comparison and quantization methods in such dimensions (pair of dimensions) are different from each other. It should be noted that dimensions (pair of dimensions) in which the extraction regions are adjacent means that partial peripheries of the extraction regions contact each other. For example, between dimensions (pair of dimensions) in which the extraction regions are adjacent, the comparison and quantization methods in such dimensions (pair of dimensions) may be different from each other. In that case, between all dimensions (pairs of dimensions) in which the extraction regions are adjacent, the comparison and quantization methods in those dimensions may be different from each other. It is also possible that among the dimensions (pairs of dimensions) in which the extraction regions are adjacent, the comparison and quantization methods may be different from each other in the dimensions (pairs of dimensions) of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the extraction regions are adjacent, the comparison and quantization methods between dimensions may be different from each other in at least one pair of dimensions.

With the comparison and quantization methods being different from each other between the dimensions (pairs of dimensions) in which the extraction regions are adjacent to each other, the following advantageous effect can be achieved. Between dimensions in which the extraction regions are adjacent, correlation between the extracted features tends to be large. This is because the distance between the extraction regions of the two dimensions is close between the dimensions in which the extraction regions are adjacent to each other (correlation is high between close regions within an image). If the comparison and quantization methods in those regions are the same, the correlation between the features is larger, whereby the redundancy in the entire feature vector becomes high, so that the discrimination capability is lowered. As such, by using different the comparison and quantization methods in those regions in order to offset the correlation between the extracted features becoming large due to the fact that the extraction regions are adjacent, the correlation between the features can be reduced, whereby the redundancy in the entire feature vector can be low, so that it is possible to prevent deterioration in the discrimination capability.

From an opposite point of view, between dimensions (pair of dimensions) in which the comparison and quantization methods are the same, it is desirable that the extraction regions in those dimensions (pair of dimensions) are not adjacent to each other. For example, between dimensions (pair of dimensions) in which the comparison and quantization methods are the same, the extraction regions in such dimensions (pair of dimensions) may not be adjacent. In that case, between all dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the extraction regions in those dimensions (pairs of dimensions) may not be adjacent. It is also possible that among the dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the extraction regions in the dimensions (pairs of dimensions) may not be adjacent in the dimensions of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the extraction regions may not be adjacent in at least one pair of dimensions.

Further, between dimensions (pair of dimensions) in which the extraction regions partially overlap, it is desirable that the comparison and quantization methods in such dimensions (pair of dimensions) are different from each other. For example, between dimensions (pair of dimensions) in which the extraction regions partially overlap, the comparison and quantization methods in such dimensions (pair of dimensions) may be different from each other. In that case, between all dimensions (pairs of dimensions) in which the extraction regions partially overlap, the comparison and quantization methods in those dimensions may be different from each other. It is also possible that among the dimensions (pairs of dimensions) in which the extraction regions partially overlap, the comparison and quantization methods may be different from each other in the dimensions (pairs of dimensions) of a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the extraction regions partially overlap, the comparison and quantization methods may be different from each other in at least one pair of dimensions.

With the comparison and quantization methods being different from each other between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, the following advantageous effect can be achieved. Between dimensions in which the extraction regions partially overlap, correlation between the extracted features tends to be large. This is because between the dimensions in which the extraction regions partially overlap, the regions used for calculating the features are shared partially. If the comparison and quantization methods in those regions are the same, the correlation between the features is larger, whereby the redundancy as the entire feature vector becomes high, so that the discrimination capability is lowered. As such, by using different comparison and quantization methods in those regions in order to offset the correlation between the extracted features becoming large due to the fact that the extraction regions partially overlap, the correlation between the features can be reduced, whereby the redundancy as the entire feature vector can be low, so that it is possible to prevent deterioration in the discrimination capability.

With the comparison and quantization methods being different from each other between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, another advantageous effect can be achieved. With the comparison and quantization methods being different from each other between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, there is an advantage that tolerance against falsification (particularly, malicious falsification) in an image can be enhanced. Malicious falsification to an image is conducted by changing the pixel value of a partial region of the image, for example, in an attempt to deteriorate accuracy in identity determination by the image signature (feature vector) extracted from the image. Between the dimensions in which the extraction regions are partially overlap, if the overlapped region of the image is falsified, that is, if the pixel value of the overlapped region is changed, the feature (region feature) extracted therefrom is affected, whereby it is highly likely that the feature may be different from the feature extracted from the region which was not falsified. If the comparison and quantization methods in those dimensions are the same, the features extracted from the extraction regions of the respective dimensions are affected in a similar manner, whereby the possibility that the features are changed at the same time would be high, so that the robustness is low. If the comparison and quantization methods in those dimensions are different, even if the overlapped region is falsified, the possibility that the features are affected in a similar manner so that the features are changed at the same time can be reduced, whereby the robustness can be secured. As such, it becomes difficult to falsify the overlapped region by changing the features of a plurality of dimensions sharing the overlapped region at the same time. Accordingly, by using different comparison and quantization methods between the dimensions (pairs of dimensions) in which the extraction regions partially overlap, tolerance against falsification (particularly, malicious falsification) in an image can be enhanced.

From an opposite point of view, between dimensions (pair of dimensions) in which the comparison and quantization methods are the same, it is desirable that the extraction regions in those dimensions (pair of dimensions) do not overlap each other. For example, between dimensions (pair of dimensions) in which the comparison and quantization methods are the same, the extraction regions in such dimensions (pair of dimensions) may not overlap each other. In that case, between all dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the extraction regions in those dimensions (pairs of dimensions) may not overlap each other. It is also possible that among the dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the extraction regions may not overlap each other in the dimensions (pairs of dimensions) in a predetermined proportion or larger, or among the dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the extraction regions may not overlap each other in at least one pair of dimensions.

From a similar point of view, between dimensions (pair of dimensions) in which the comparison and quantization methods are the same, it is desirable that the combinations of the shapes of the pairs of extraction regions are different. Further, between dimensions (pair of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, it is desirable that the comparison and quantization methods are different. For example, between dimensions (pair of dimensions) in which the comparison and quantization methods are the same, the combinations of the shapes of the pairs of extraction regions may be different. Further, between dimensions (pair of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the comparison and quantization methods may be different. In that case, between all dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the combinations of the shapes of the pairs of extraction regions may be different. Further, between all dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the comparison and quantization methods may be different. It is also possible that among the dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the combinations of the shapes of the pairs of extraction regions may be different in the dimensions of a predetermined proportion or larger. Further, it is also possible that among the dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the comparison and quantization methods may be different in the dimensions of a predetermined proportion or larger. It is also possible that among the dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the combinations of the shapes of the pairs of extraction regions may be different in at least one pair of dimensions. Further, it is also possible that among the dimensions (pairs of dimensions) in which the combinations of the shapes of the pairs of extraction regions are the same, the comparison and quantization methods may be different in at least one pair of dimensions.

From a similar point of view, between dimensions (pair of dimensions) in which the comparison and quantization methods are the same, it is desirable that the region feature calculation methods are different. Further, between dimensions (pair of dimensions) in which the region feature calculation methods are the same, it is desirable that the comparison and quantization methods are different. For example, between dimensions (pair of dimensions) in which the comparison and quantization methods are the same, the region feature calculation methods may be different. Further, between dimensions (pair of dimensions) in which region feature calculation methods are the same, the comparison and quantization methods may be different. In that case, between all dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the region feature calculation methods may be different. Further, between all dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the comparison and quantization methods may be different. It is also possible that among the dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the region feature calculation methods may be different in the dimensions of a predetermined proportion or larger. Further, it is also possible that among the dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the comparison and quantization methods may be different in the dimensions of a predetermined proportion or larger. It is also possible that among the dimensions (pairs of dimensions) in which the comparison and quantization methods are the same, the region feature calculation methods may be different in at least one pair of dimensions. Further, it is also possible that among the dimensions (pairs of dimensions) in which the region feature calculation methods are the same, the comparison and quantization methods may be different in at least one pair of dimensions.

The comparison method acquisition unit 6 acquires, from the each-dimension comparison and quantization method information supplied as an input, information indicating the comparison and quantization method corresponding to the dimension supplied from the dimension determination unit 1, and supplies the information to the comparison unit 4B.

The comparison unit 4B compares a first region feature with a second region feature supplied from the region feature calculation unit 3 for each dimension and quantizes, according to the information indicating the comparison and quantization method supplied from the comparison method acquisition unit 6, and outputs a quantization index. The comparison unit 4B may have a configuration including both the comparison unit 4 of the first embodiment and the comparison unit 4B of the second embodiment if necessary, depending on the comparison and quantization method.

In the comparison unit 4B, it is necessary that the dimension of the region feature to be supplied and the dimension of the information indicating the comparison and quantization method are synchronized.

[Operation of Fourth Embodiment]

Next, with reference to the flowchart of FIG. 13, operation of the image signature extraction device according to the fourth embodiment will be described. In the flowchart of FIG. 13, a dimension (number) of a feature vector is indicated by “n”, and there are N dimensions in total from 1 to N.

First, the dimension determination unit 1 determines a dimension 1 as the first dimension (n=1) for extracting a feature vector, and supplies it to the extraction region acquisition unit 2 and the comparison method acquisition unit 6 (step D1). Next, the extraction region acquisition unit 2 acquires information indicating a first extraction region and a second extraction region of the dimension n from each-dimension extraction region information supplied as an input, and supplies it to the region feature calculation unit 3 (step D2).

Then, the comparison method acquisition unit 6 acquires information indicating the comparison and quantization method corresponding to the dimension n from the each-dimension comparison and quantization method information supplied as an input, and supplies it to the comparison unit 4B (step D3).

Then, the region feature calculation unit 3 calculates a first region feature and a second region feature of the dimension n from the image supplied as an input, and supplies the features to the comparison unit 4B (step D4). Then, the comparison unit 4B compares the first region feature with the second region feature of the dimension n, quantizes the comparison result, and outputs a quantization index (step D5). Then, it is determined whether or not output of the quantization indexes for all dimensions has been completed (step D6). If output of the quantization indexes for all dimensions has been completed, the processing ends. If output of the quantization indexes for all dimensions has not been completed, the processing proceeds to step D7. At step D7, the dimension determination unit 1 determines the next dimension for extracting a feature vector (n=n+1), and supplies it to the extraction region acquisition unit 2 and the comparison method acquisition unit 6. Then, the processing returns to step D2.

It should be noted that although the extraction processing is performed in order from the dimension 1 to the dimension N in this embodiment, any order may be taken without being limited to this order. Further, it is also possible to perform the extraction processing for a plurality of dimensions in parallel, without limiting to such processing procedures. Further, step D2 and step D3 may be in reverse order, and step D3 may be performed immediately before step D5.

[Effect of Fourth Embodiment]

In addition to the advantageous effects of the first embodiment, the fourth embodiment has an advantageous effect that the discrimination capability which is a degree of discriminating different images can be further improved.

This is because as the comparison and quantization methods are different among the dimensions (variable comparison and quantization methods are used), correlation between dimensions can be small.

Fifth Embodiment

[Configuration of Fifth Embodiment]

Next, a fifth embodiment of the present invention will be described in detail with reference to the drawings.

Referring to FIG. 33, the configuration of the fifth embodiment of the present invention is different from that of the first embodiment shown in FIG. 1 in that an encoding unit 7 is added. As the other components are the same as those of the first embodiment, the explanation thereof is omitted in this embodiment. It should be noted that although a combination with the first embodiment is described in this embodiment, a combination with the second embodiment, the third embodiment, or the fourth embodiment is also acceptable.

The encoding unit 7 encodes the quantization index vector supplied from the comparison unit 4 into a format which is uniquely decodable so as to reduce the amount of data, and outputs the encoded quantization index vector.

The encoding unit 7 may encode the quantization index vector to have a smaller amount of data by collectively encoding a plurality of dimensions, rather than independently encoding each of the dimensions of the quantization index vector.

(K) Now, a method of effectively encoding the quantization index vector by the encoding unit 7, when the quantization indexes are calculated based on Expression 2, will be described. When the quantization indexes are calculated based on Expression 2, the quantization index of each dimension may take any one of three values (+1, 0, −1). If encoding is performed independently on each dimension, 2 bits (=4 states) is required for each dimension. Now, if encoding is collectively performed on 5 dimensions (5 dimensions may be of any combinations, including continuous 5 dimensions, for example), the number of states is 3 to the fifth power=243 states, which can be represented as 1 bite=8 bits (=256 states) (within 256 states). In that case, the average number of bits required for one dimension is 8/5=1.6 bits, whereby the amount of data can be reduced compared with the case of performing encoding independently for each dimension (reduction of 0.4 bit per dimension is possible). For example, if the total number of dimensions of the quantization index vector is 300 dimensions, when encoding is performed independently for each dimension, 2 bits*300=600 bits=75 bytes. On the other hand, when encoding is performed collectively on 5 dimensions, 1.6 bits*300=480 bites=60 bytes, whereby 15 bytes can be reduced.

(L) A specific example of performing encoding on each 5 dimensions in three values (+1, 0, −1), calculated according to Expression 2, will be described below. While each set of 5 dimensions may take any combination, there is a method of performing encoding on each set of continuous 5 dimensions. This means that the 1^(st) dimension to the 5^(th) dimension are collectively encoded, the 6^(th) dimension to the 10^(th) dimension are collectively encoded, and the 11^(th) dimension to the 15^(th) dimension are collectively encoded (of course, any combination of 5 dimensions is acceptable if they do not overlap each other). Assuming that the values of the quantization indexes of 5 dimensions to be collectively encoded are Q_(n), Q_(n+1), Q_(n+2), Q_(n+3), and Q_(n+4) (each of which takes any of +1, 0, −1), a value Z which is encoded according to the following expression can be calculated, for example. Z={3⁴*(Q _(n)+1)}+{3³*(Q _(n+1)+1)}+{3²*(Q _(n+2)+1)}+{3¹*(Q _(n+3)+1)}+{3⁰*(Q _(n+4)+1)}  [Expression 3]

(M) As the coded value Z takes a value from 0 to 242 (243 states), the quantization index values are encoded as 1-bite (8-bit) data. It should be noted that the method of mapping the quantization index values Q_(n), Q_(n+1), Q_(n+2), Q_(n+3), and Q_(n+4) of five dimensions, encoded collectively, to be a value from 0 to 242 (243 states) is not limited to Expression 3. Any methods may be used if a different combination of quantization indexes in five dimensions is mapped into a different value (value in 243 states). It is possible to calculate mapping (a value after encoding) and perform encoding based on a given expression such as Expression 3, or to generate and store a correspondence table for mapping beforehand and then acquire mapping (a value after encoding) with reference to the stored correspondence table and perform encoding.

The method of effectively performing encoding when the quantization indexes are calculated based on Expression 2, as described in paragraphs (K)-(M), is not limited to the case where the quantization indexes are calculated based on Expression 2, but may be applicable to any quantization index vector if the quantization indexes are in the state of three values. This means that if a quantization index vector consists of quantization indexes in the state of three values, 5 dimensions can be encoded collectively in 1 byte=8 bits. As 243 types of different combinations of quantization indexes of 5 dimensions, in the state of three values, are available, by mapping the respective combinations to values from 0 to 242 (243 states), they can be encoded with 1 byte=8 bits. This mapping may be performed by calculating the mapping (value after encoding) based on a given expression such as Expression 3 and performing encoding, or generating and storing a correspondence table for mapping beforehand and then acquiring mapping (a value after encoding) with reference to the stored correspondence table and performing encoding.

As described above, by encoding a plurality of dimensions of a quantization index vector collectively rather than encoding each dimension independently, there is an advantageous effect that encoding can be performed while reducing the amount of data, compared with the case of encoding each dimension of the quantization index vector independently.

This is not limited to the case where quantization indexes are represented in the state of three values. For example, if quantization indexes are represented in the state of five values, by encoding 3 dimensions collectively, the number of states is 5 to the third power=125 states, whereby the quantization indexes can be encoded in 7 bits=128 states (within 128 states). If 3 dimensions are encoded independently, 3 bits (8 states)*3 dimensions=9 bits are required. As such, by encoding 3 dimensions collectively, it is possible to reduce 2 bits.

It should be noted that when performing matching on encoded quantization index vectors output from the encoding unit 7 (when comparing a quantization index vector extracted from an image with a quantization index vector extracted from another image to determine whether or not the images are identical), it is also possible to decode the value of the quantization index of each dimension in the encoded state (in the above example, decoding the encoded value to the quantization index value of +1, 0, or −1 for each dimension), and based on the decoded quantization index value, calculate the identity scale (the number of dimensions in which quantization indexes coincide (similarity)) or the number of dimensions in which quantization indexes do not coincide (Hamming distance).

(N) Further, with use of a lookup table, it is also possible to perform matching in the encoded state, without decoding the value to the quantization index value for each dimension. This means that by storing identity scales (similarity or distance) in the form of a table (lookup table) for each encoded unit beforehand and referring to the lookup table, it is possible to acquire the identity scale (similarity or distance) for each encoded unit and sum the identity scales (calculate the total, for example) to thereby obtain the identity scale of the all dimensions.

(O) For example, in the case where 5 dimensions are collectively encoded in 1 byte (8 bits), as each 5-dimension unit is in any of 243 states, it is possible to address by generating a lookup table of a 243*243 size beforehand. Namely, identity scales between the all available combination states (243 states by 243 states) of codes of two 5-dimension units to be compared, that is, the number in which quantization indexes coincide in the 5 dimensions (similarity) or the number in which quantization indexes do not coincide in the 5 dimensions (Hamming distance) are calculated, and is stored as a lookup table of a 243*243 size, beforehand. With this table, it is possible to acquire the identity scale for each 5-dimension unit with reference to the lookup table for each 5-dimension unit (without decoding the encoded value to the quantization index of each dimension). For example, if the total number of dimensions of a quantization index vector is 300 dimensions, as 5 dimensions are encoded in 1 byte so that the quantization index vector is encoded in 60 bytes in total, the identity scale (similarity or Hamming distance) of the entire vector (300 dimensions) can be calculated by referring to the lookup table 600 times, acquiring the identity scale for each 5-dimension unit, and summing them. With use of the lookup table, as it is possible to perform matching (calculation of identity scale) without decoding the encoded value to the quantization index of each dimension, there is an advantageous effect that the processing cost for matching (calculation of identity scale) can be reduced and matching can be performed at a high speed.

(P) Further, even in the case of calculating the identity scale between two quantization index vectors based on more complicated expression, rather than simply calculating the identity scale as the number of dimensions in which quantization indexes coincide (similarity) or the number of dimensions in which quantization indexes do not coincide (Hamming distance), with use of a lookup table, it is also possible to perform matching (calculation of identity scale), without decoding the values to the quantization indexes of the respective dimensions. For example, as an identity scale of quantization index vectors in which the quantization indexes are calculated based on Expression 2, a method of calculating an identity scale as shown below will be considered. First, corresponding dimensions of the quantization index vectors of two images are compared, the number of dimensions in which not “both quantization indexes are 0” is calculated, and this value is set to be A. Next, in the dimensions in which not “both quantization indexes are 0”, the number of dimensions in which the quantization indexes coincide is calculated as B (or in the dimensions in which not “both quantization indexes are 0”, the number of dimensions in which the quantization indexes doe not conform is calculated as C). Then, an identity scale is calculated as B/A (or an identity scale is calculated as C/A). If A=0 (that is if both quantization indexes are 0 in every dimensions), the identity scale is set to be a predetermined numerical value (e.g., 0.5). When such a method of calculating an identity scale is adopted, it is necessary to calculate two values of A and B (or values of C). In that case, it is possible to address by generating a lookup table having a size of 243*243 for referring to the values of A for each 5-dimension unit and a lookup table having a size of 243*243 for referring the values of B (or C) for each-5-dimensions unit, beforehand. This means that the values of A between all available combination states (243 states by 243 states) (the number of dimensions in which not “both quantization indexes are 0”) and the values of B (or values of C) between all available combination states (243 states by 243 states), for the signs of two 5-dimension units to be compared, are calculated beforehand. Then, each of them is stored as a lookup table having a size of 243*243. Thereby, it is possible to acquire the values of A and the values of B (or the values of C) for each 5-dimension unit with reference to the lookup tables (without decoding the quantization indexes of the respective dimensions). For example, if the total number of dimensions of a quantization index is 300 dimensions, as they are encoded in 1 byte per 5 dimensions, that is, 60 bytes in total, it is possible to calculate the values of A and the values of B (or values of C) by acquiring the values of A and the values of B (or values of C) for each 5-dimension unit with reference to the lookup tables 60*2 times, and summing the values of A and the values of B (or values of C) of all dimensions (300 dimensions). Finally, by calculating B/A (or C/A), the identity scale can be calculated. As described above, even in the case of calculating the identity scale based on more complicated expressions rather than simply calculating the identity scale as the number of dimensions in which quantization indexes coincide (similarity) or the number of dimensions in which quantization indexes do not coincide (Hamming distance), it is possible to perform matching (calculating of the identity scale) with reference to the lookup tables without decoding the values to the quantization indexes or the respective dimensions. This provides advantageous effects that the processing costs for matching (calculation of identity scale) can be reduced, and matching (calculation of identity scale) can be performed at a higher speed.

[Effect of Fifth Embodiment]

It is possible to output a quantization index vector in a smaller amount of data.

Next, other embodiments of the present invention will be shown.

Sixth Embodiment

In this embodiment, the number of dimensions of a feature vector to be extracted is 300 dimensions (from 1^(st) dimension to 300^(th) dimension).

In this embodiment, the extraction regions (first extraction regions and second extraction regions) for respective dimensions are formed of quadrangles in various shapes. FIG. 14 shows each-dimension extraction region information to be supplied to the extraction region acquisition unit 2 as an input in this embodiment. FIG. 14 shows XY coordinate values of the four corners of the quadrangles of the extraction regions (first extraction regions and second extraction regions) for the respective dimensions, with respect to the image size of 320 pixel wide and 240 pixel long, which is a predetermined image size. For example, the extraction regions for a 1^(st) dimension is formed of a first extraction region consisting of a quadrangle with four corners having a coordinate value (262.000, 163.000), a coordinate value (178.068, 230.967), a coordinate value (184.594, 67.411), and a coordinate value (100.662, 135.378), and a first extraction region consisting of a quadrangle with four corners having a coordinate value (161.000, 133.000), a coordinate value (156.027, 132.477), a coordinate value (164.240, 102.170), and a coordinate value (159.268, 101.647).

The extraction regions (first extraction region and second extraction region) for each dimension is a collection of pixels having coordinate values of integer values included in a region defined by these coordinate values of the four corners, with respect to the image normalized to an image size of 320 pixel wide and 240 pixel long. However, negative coordinate values included in the region defined by the four corners are not included in the extraction region.

FIG. 15 shows each-dimension region feature calculation method information supplied to the region feature calculation method acquisition unit 5 as an input, in this embodiment. In the sixth embodiment, a mean value of the luminance values of a group of pixels included in each of the extraction regions (first extraction region and second extraction region) serves as a region feature of each of the extraction regions, for every dimension.

FIG. 17 shows each-dimension comparison and quantization method information supplied to the comparison method acquisition unit 6 as an input, in this embodiment. In this embodiment, the comparison and quantization method B or the comparison and quantization method G is used for each dimension, and the value of the parameter is also different for each dimension. For example, in the 1^(st) dimension, the comparison and quantization method G is used, and the threshold th is D(floor(300*5.0/100)). In the 2^(nd) dimension, the comparison and quantization method G is used, and the threshold th is D(floor(300*10.0/100)). Further, in the 9^(th) dimension, for example, the comparison and quantization method B is used, and the threshold th is 3.0.

Seventh Embodiment

In this embodiment, the number of dimensions of a feature vector to be extracted is 300 dimensions (from 1^(st) dimension to 300^(th) dimension), as in the sixth embodiment. In this embodiment, as each-dimension extraction region information supplied to the extraction region acquisition unit 2 as an input, the information shown in FIG. 14 is used, as in the sixth embodiment. Further, in this embodiment, as each-dimension comparison and quantization method information supplied to the comparison method acquisition unit 6 as an input, the information shown in FIG. 17 is used, as in the sixth embodiment.

FIG. 16 shows each-dimension region feature calculation method information supplied to the region feature calculation method acquisition unit 5 as an input, in this embodiment. In this embodiment, for each dimension, a mean value of luminance values of a group of pixels included in the extraction regions (first extraction region and second extraction region) or a percentile luminance value feature is used, and the feature is different for each dimension even if the same percentile luminance value feature is used. For example, in the 1^(st) dimension, a mean value of luminance values of the pixels included in the extraction regions is used. In the 4^(th) dimension, for example, a percentile luminance value feature is used, and the value is Y(floor(N*20.0/100)). Further, in the 8^(th) dimension, a percentile luminance value feature is used, and the value is Y(floor(N*80.0/100)).

Eighth Embodiment

In this embodiment, the number of dimensions of a feature vector to be extracted is 325 dimensions (1^(st) dimension to 325^(th) dimension). In this embodiment, each region consists of a combination of blocks among 1024 pieces of blocks formed by dividing an image into 32 pieces vertically and 32 pieces horizontally. To the respective blocks, indexes starting from 0 are assigned from the upper left part as shown in FIG. 24, and the regions are described using those indexes. Specifically, a rectangle region is indicated using an index “a” of the upper left block and an index “b” of the lower right block in a manner of “a-b”. For example, a rectangle, formed of four blocks having indexes of 0, 1, 32, and 33, is described as 0-33. Further, if rectangles formed in this manner are linked using a sign “1”, they represent a region formed by linking the rectangles before and after the sign. For example, 0-33|2-67 indicates a region formed by linking a rectangle defined by 0-33 and a rectangle defined by 2-67, that is, a region formed by the block numbers 0, 1, 2, 3, 32, 33, 34, 35, 66, and 67.

FIG. 25 shows the regions, described in this manner, corresponding to the respective dimensions of this embodiment. In FIG. 25, the 325 dimensions are described by classifying them by the type in FIG. 25-a, FIG. 25-b, FIG. 25-c, FIG. 25-d, FIG. 25-e, FIG. 25-f, and FIG. 25-g. In these figures, the type of a region means a group consisting of the dimensions having similar region patterns determined by the combinations of relative positions or shapes between the first and second extraction regions.

Specifically, FIG. 25-a corresponds to the case where two regions, formed by dividing a square defined by four blocks vertically and four blocks horizontally into two in a vertical or horizontal direction, are used as first and second extraction regions, an example of which is shown in FIG. 27-a. As such, the shape of both the first and second extraction regions is a rectangle defined by four blocks vertically and two blocks horizontally or a rectangle defined by two blocks vertically and four blocks horizontally. Further, regarding the relative positional relation between the first and second extraction regions, they are present at positions adjacent to each other such that the longitudinal sides of the rectangles overlap each other.

FIG. 25-b corresponds to the case where two regions, formed by equally dividing a square defined by eight blocks vertically and eight blocks horizontally in vertical and horizontal directions into four squares and combining the upper left and lower right squares and combining the upper right and lower left squares, respectively, are used as a first and second extraction regions, an example of which is shown in FIG. 27-b. As such, the shape of both the first and second extraction regions is that two squares, defined by two blocks vertically and two blocks horizontally, are arranged on a diagonal line at an angle of 45 degrees or 135 degrees so as to share one vertex. Further, regarding the relative positional relation between the regions, the two squares constituting the second region are present at a position adjacent to the left and below of the upper left square of the first region.

In the case of FIG. 25-c, the shape of both the first and second extraction regions is a square defined by 10 blocks vertically and 10 blocks horizontally, an example of which is shown in FIG. 27-c. Regarding the relative positional relation between the first and second extraction regions, they are present at positions distant by the integral multiple of 10 blocks vertically and horizontally from each other.

In the case of FIG. 25-d, the shape of both the first and second extraction regions is a square defined by 8 blocks vertically and 8 blocks horizontally, an example of which is shown in FIG. 27-d. Regarding the relative positional relation between the first and second extraction regions, they are present at positions distant by the integral multiple of 6 blocks vertically and horizontally from each other.

FIG. 25-e corresponds to the case where two regions, formed by dividing a square region into a center portion and an outside portion, are used as a first and second extraction regions, an example of which is shown in FIG. 27-e. As such, the shape of the second extraction region is a square of the center portion, and the shape of the first extraction region is a square in which the second extraction region is cut out from the whole square. Further, regarding the relative positional relation between the regions, the second region is present at the center hole of the first region.

In the case of FIG. 25-f, the shape of the first extraction region is a rectangle defined by 6 blocks vertically and 10 blocks horizontally, and the shape of the second extraction region is a rectangle defined by 10 blocks vertically and 6 blocks horizontally, an example of which is shown in FIG. 27-f. Regarding the relative positional relation between the first and second extraction regions, they are arranged such that the center positions thereof coincide.

FIG. 25-g corresponds to the case where two regions, formed by dividing a rectangle defined by 4 blocks vertically and 12 blocks horizontally or a rectangle defined by 12 blocks vertically and 4 blocks horizontally into a center square region formed by trisecting the longitudinal side and the other region, are used as a first and second extraction regions, an example of which is shown in FIG. 27-g. As such, the shape of the first region is in two squares defined by four blocks vertically and four blocks horizontally separated from each other by four blocks vertically or horizontally, and the shape of the second extraction region is a square defined by four blocks vertically and four blocks horizontally. Further, regarding the relative positional relation between the regions, the second region is present between the squares of the first region.

Hereinafter, the region types of FIG. 25-a, FIG. 25-b, FIG. 25-c, FIG. 25-d, FIG. 25-e, FIG. 25-f, and FIG. 25-g are respectively referred to as a region type a, a region type b, a region type c, a region type d, a region type e, a region type f, and a region type g.

In this embodiment, a mean value of the luminance values is calculated as a region feature in each region shown in FIG. 25 and a feature of each dimension is calculated. Of course, it is possible to obtain a value extracted by the previously-described various extraction methods, such as a median or a maximum value, instead of the mean value of the luminance values as a region feature.

For quantizing the feature of each dimension, a threshold is set for each of the types of the regions to perform quantization. For example, when quantizing a feature to three values according to Expression 2, a threshold th for quantization is determined such that the proportion of occurrence of 0, 1, and −1 becomes equal for each of the types of regions, and quantization is performed. Specifically, a threshold th is obtained by applying the method described in paragraph (J) for each type of region, in which P=33.333%, and N represents the number of dimensions for each type of region. For example, as N=113 in the region type a, a threshold is calculated by th=D(floor(113*33.333/100))=D(37). It should be noted that D(i) (i=0, 1, . . . , N−1) is a collection in which the absolute values of the difference values of the 1^(st) dimension to the 113^(th) dimension are sorted in ascending order. In this case, an index corresponding to the threshold is 37. Similarly, an index corresponding to a threshold can be obtained for another region type, as shown in FIG. 26. By obtaining a threshold for each region type, it is possible to uniform the occurrence probability of 0, 1, and −1 in each dimension, compared with the case of determining a threshold collectively, whereby the discrimination capability is improved. Of course, it is possible to perform quantization by the other various quantization methods which have been described above.

It should be noted that in the case of this embodiment, it is also possible to first calculate a representative value for each block (e.g., a mean value of luminance values of pixels within a block) shown in FIG. 24, and then extract a region feature. Thereby, extraction can be performed at a higher speed than the case of directly extracting a region feature from all pixels within the region. Further, extraction regions of each region type have a symmetric property as a whole. As such, even in the cases where right and left or up and down of images are inverted, by changing the correspondence relation and signs of the dimensions appropriately, it is possible to restore the features of the original image from the features extracted from the image in which right and left or up and down are inverted. As such, matching can also be performed on an image in which right and left or up and down are inverted.

Ninth Embodiment

In this embodiment, the number of dimensions of a feature vector to be extracted is 328 dimensions (1^(st) dimension to 325^(th) dimension). In this embodiment, each region consists of a combination of blocks among 1024 pieces of blocks shown in FIG. 24, as in the case of the eighth embodiment, and the 328 dimensions are described by classifying them by the type, which is the same as that in the eighth embodiment, in FIG. 30-a, FIG. 30-b, FIG. 30-c, FIG. 30-d, FIG. 30-e, FIG. 30-f, and FIG. 30-g.

Even in this embodiment, a mean value of the luminance values is calculated as a region feature in each region shown in FIG. 30 and a feature of each dimension is calculated. Of course, it is possible to obtain a value extracted by the previously-described various extraction methods, such as a median or a maximum value, instead of the mean value of the luminance values as a region feature.

Quantization of each dimension is also the same as that of the eighth embodiment. FIG. 31 shows the indexes corresponding to the threshold of this case. Of course, it is possible to perform quantization by the other various quantization methods which have been described above.

[Embodiment of Matching Unit]

Next, a matching unit for matching quantization index vectors output in the present invention will be described using a block diagram.

Referring to FIG. 20 showing a block diagram of a matching unit 100 for matching quantization index vectors output in the present invention, the matching unit 100 includes a dimension determination unit 101, quantization value acquisition units 102 and 103, and a scale calculation unit 104.

The dimension determination unit 101 is connected to the quantization value acquisition units 102 and 103, and outputs determined dimension information. The quantization value acquisition unit 102 acquires, from a first quantization index vector, a quantization index value of the dimension input from the dimension determination unit 101, and outputs the value to the scale calculation unit 104 as a first quantization index value. The quantization value acquisition unit 103 acquires, from a second quantization index vector, a quantization index value of the dimension input from the dimension determination unit 101, and outputs the value to the scale calculation unit 104 as a second quantization index value. The scale calculation unit 104 calculates a scale indicating the identity from the first and second quantization index values output from the quantization value acquisition units 102 and 103, and outputs it.

Next, operation of the matching unit 100 shown in FIG. 20 will be described.

First, to the matching unit 100, the first quantization index vector which is a quantization index vector extracted from a first image, and a second quantization index vector which is a quantization index vector extracted from a second image, are input. The input first and second quantization index vectors are respectively input to the quantization value acquisition units 102 and 103.

To the quantization value acquisition units 102 and 103, dimension information output from the dimension determination unit 101 is also input. The dimension determination unit 101 sequentially outputs information designating respective dimensions of the quantization index vectors which are N dimension vectors. The output order is not necessary incremented by one from 1 to N, and may be in any order if all dimensions from 1 to N are designated without deficiency and excess.

The quantization value acquisition units 102 and 103 acquire, from the input quantization index vectors, quantization index values of the dimension designated in the dimension information output from the dimension determination unit 101, and output the acquired quantization index values to the scale calculation unit 104.

The scale calculation unit 104 compares the first quantization index value output from the quantization value acquisition unit 102 with the second quantization index value. This comparison is performed on the respective dimensions, and a similarity scale (or distance scale) between the first and second quantization index vectors is calculated as an identity scale.

The acquired identity scale is compared with a predetermined threshold to determine the identity. If the identity scale is a scale indicating the similarity, they are determined to be identical if the scale value is equal to or larger than the threshold. On the other hand, if the identity scale is a scale indicating the distance, they are determined to be identical if the scale value is smaller than or equal to the threshold.

Next, operation of the matching unit 100 shown in FIG. 20 will be described using a flowchart. First, operation in the case of using a similarity as an identity scale will be described.

FIG. 21 is a flowchart showing the operation of the matching unit 100. In the flowchart of FIG. 21, a dimension (number) of a feature vector is indicated by “n”, and there are N dimensions in total from 1 to N. Further, a variable for calculating the similarity is indicated by B.

First, the dimension determination unit 101 determines a dimension 1 as the first dimension (n=1) for matching a quantization index vector, and supplies it to the quantization acquisition units 102 and 103 and sets the variable B to be 0 in the scale calculation unit 104 (step S100).

Then, the quantization acquisition units 102 and 103 acquire a first quantization index value and a second quantization index value of the dimension n from the first quantization index vector and the second quantization index vector, and supply them to the scale calculation unit 104 (step S102).

Then, the scale calculation unit 104 calculates, from the first quantization index value and the second quantization index value, a similarity ΔB between the features corresponding to the respective quantization indexes (step S104). For example, ΔB=1 when the quantization indexes conform to each other, and ΔB=0 in other cases. Alternatively, it is also possible to calculate representative values of the features before quantization from the quantization indexes and use a value, which is increased as the difference between the representative values is smaller, as ΔB. In that case, instead of obtaining a difference by calculating the representative values of the features, it is possible to hold a table in which the value of ΔB is acquired from a combination of quantization index values, and directly obtain the value of ΔB using the table from the combination of the quantization index values.

Next, the value of ΔB is added to the variable B (step S106). At this point, if the value of ΔB is 0, it is possible to control not to add, rather than adding 0 to the variable B.

Next, it is checked whether the dimension number n reaches the number of dimension N (step S108), and if the number does not reach, the processing moves to step S112, while if the number reached, the value of the variable B at that point is output as an identity scale (scale indicating similarity) (step S110) and the processing ends.

At step 112, the dimension determination unit 101 determines the next dimension from n=n+1 as the dimension for acquiring quantization indexes, and supplies it to the quantization value acquisition units 102 and 103. Then, the processing returns to step S102.

It should be noted that although the extraction processing is performed in order from the dimension 1 to the dimension N, any order may be taken without being limited to this order.

Next, operation in the case of using a distance as an identity scale will be described.

FIG. 22 is another flowchart showing the operation of the matching unit 100. Also in the flowchart of FIG. 22, a dimension (number) of a feature vector is indicated by “n”, and there are N dimensions in total from 1 to N. Further, a variable for calculating a distance scale is indicated by C.

While the basic flow is similar to that of FIG. 21, FIG. 22 is different in that steps S100, S104, S106, and S110 are respectively replaced with steps S200, S204, S206, and S210.

First, at step S200, the dimension determination unit 101 determines a dimension 1 as the first dimension (n=1) for matching a quantization index vector, and supplies it to the quantization acquisition units 102 and 103 and sets the variable C to be 0 in the scale calculation unit 104.

At step S204, the scale calculation unit 104 calculates, from the first quantization index value and the second quantization index value, a distance ΔC between the features corresponding to the respective quantization indexes. For example, ΔC=0 when the quantization indexes conform to each other, and ΔC=1 in other cases. Alternatively, it is also possible to calculate representative values of the features before quantization from the quantization indexes, and use a value, which is decreased as the difference between the representative values is smaller, as ΔC. In that case, instead of obtaining a difference by calculating the representative values of the features, it is possible to hold a table in which the value of ΔC is acquired from a combination of quantization index values, and directly obtain the value of ΔC using the table from the combination of the quantization index values.

At step S206, the value of ΔC is added to the variable C. At this point, if the value of ΔC is 0, it is possible to control not to add, rather than adding 0 to the variable C.

At step S210, the value of the variable C at that point is output as an identity scale (scale indicating distance) and the processing ends.

The other steps are the same as those in the case of FIG. 21. However, if the dimension number n reached the number of dimensions N at step S108, the processing moves to step S210.

It should be noted that although the extraction processing is performed in order from the dimension 1 to the dimension N, any order may be taken without being limited to this order.

Next, description will be given for the operation in the case where a dimension in which “both quantization indexes are 0” for the first quantization index value and the second quantization index value is eliminated, and a similarity is used as an identity scale.

FIG. 23 is another flowchart showing the operation of the matching unit 100. Also in the flowchart of FIG. 23, a dimension (number) of a feature vector is indicated by “n”, and there are N dimensions in total from 1 to N. Further, a variable for calculating the similarity is indicated by B, and a variable for counting the dimensions in which not “both quantization indexes are 0” is indicated by A.

First, the dimension determination unit 101 determines a dimension 1 as the first dimension (n=1) for matching a quantization index vector, and supplies it to the quantization acquisition units 102 and 103, and sets the variables A and B to be 0 in the scale calculation unit 104 (step S300), and then moves to step S102.

Step S102 is the same as the case of FIG. 21, and when step S102 ends, the processing moves to step S314.

At step S314, the scale calculation unit 104 checks whether or not both the first quantization index value and the second quantization index value are 0. If both values are 0, the processing moves to step S108, while if either of them is not 0, the value of the variable A is incremented by one (step S316), and the processing moves to step S104.

The processing at steps S104, S106, S108, and S112 is the same as that in the case of FIG. 21. If the dimension number n reached the number of dimensions N at step S108, the processing moves to step S310.

At step S310, the scale calculation unit 104 calculates the value of B/A and outputs it as an identity scale, and ends the processing. However, if A=0, the scale calculation unit 104 outputs a predetermined value (e.g., 0.5).

It should be noted that although the extraction processing is performed in order from the dimension 1 to the dimension N, any order may be taken without being limited to this order.

(D), at step S310, it is possible to calculate D=N−A and calculates an identity scale by B/f(D) (f(D) is a monotone nonincreasing function), rather than calculating B/A. Alternatively, as described in paragraph (E), an identity scale may be calculated as (B/f(D))+g(D).

Further, it is also possible to directly calculate the value of D without calculating the value of A. FIG. 35 shows the flow of this case. Although it is basically the same as that of FIG. 23, the flow differs from that of FIG. 23 in that 0 is set to the variable D, rather than A, at step S500, the variable D is incremented by one at step S516 if both quantization indexes are 0 at step S314 and the processing moves to step S108, while if either one of the quantization indexes is not 0, the processing moves to step S104 and an identity scale is calculated from B and D by means of the above-described method at step S510.

Next, description will be given for the operation in the case where a dimension in which “both quantization indexes are 0” for the first quantization index value and the second quantization index value is eliminated, and a distance is used as an identity scale.

FIG. 34 is another flowchart showing the operation of the matching unit 100. Also in the flowchart of FIG. 34, a dimension (number) of a quantization index vector is indicated by “n”, and there are N dimensions in total from 1 to N. Further, a variable for calculating a distance scale is indicated by C, and a variable for counting the dimensions in which not “both quantization indexes are 0” is indicated by A.

While the basic flow is similar to that of FIG. 23, FIG. 34 is different in that steps S300, S104, S106, and S310 are respectively replaced with steps S400, S204, S206, and S410.

First, at step S400, the dimension determination unit 101 determines a dimension 1 as the first dimension (n=1) for matching a quantization index vector, and supplies it to the quantization acquisition units 102 and 103 and sets the variables A and C to be 0 in the scale calculation unit 104.

Steps S204 and S206 are the same as those in the case of FIG. 22.

At step S410, the scale calculation unit 104 calculates the value of C/A and outputs it as an identity scale, and ends the processing. However, if A=0, the scale calculation unit 104 outputs a predetermined value (e.g., 0.5).

The other steps are the same as those in the case of FIG. 23. However, if the dimension number n reached the number of dimensions N at step S108, the processing moves to step S410.

It should be noted that although the extraction processing is performed in order from the dimension 1 to the dimension N, any order may be taken without being limited to this order. Further, similar to the case of step S310, it is possible to calculate D=N−A and calculates an identity scale by C/f(D) or the like, rather than calculating C/A. Alternatively, it is also possible to directly calculate the value of D without calculating the value of A, as in FIG. 35.

[Second Embodiment of Matching Unit]

Next, a second embodiment of a matching unit for matching quantization index vectors output in the present invention will be described using a block diagram.

Referring to FIG. 28 showing a block diagram of a matching unit 110 for matching quantization index vectors output in the present invention, the matching unit 110 includes a dimension determination unit 101, quantization value acquisition units 102 and 103, a margin region specifying unit 105, and a corrected scale calculation unit 106.

The dimension determination unit 101 is connected to the quantization value acquisition units 102 and 103, and outputs determined dimension information. The quantization value acquisition unit 102 acquires, from a first quantization index vector, a quantization index value of the dimension input from the dimension determination unit 101, and outputs the value to the margin region specifying unit 105 as a first quantization index value. The quantization value acquisition unit 103 acquires, from a second quantization index vector, a quantization index value of the dimension input from the dimension determination unit 101, and outputs the value to the margin region specifying unit 105 as a second quantization index value.

The margin region specifying unit 105 specifies, from the first and second quantization index values of the respective dimensions (values of the respective dimensions of quantization index vectors) output from the quantization value acquisition units 102 and 103, margin regions in the original images from which the respective values are extracted (images from which the quantization index vectors are extracted, which are referred to as a first image and a second image in this embodiment), and supplies information indicating the specified margin regions (margin region information) to the corrected scale calculation unit 106. For example, for each of the predetermined one or more candidates of a margin region, the margin region specifying unit 105 compares a numerical value representing the degree that a quantization index which may be taken by the dimension in which at least one of the extraction regions is included in the margin region of the candidate coincides with the actual quantization index, with a threshold, to thereby specify the margin region. It should be noted that if it is determined that there is no margin region, the margin region specifying unit 105 supplies information that there is no margin region as margin region information, to the corrected scale calculation unit 106.

In this embodiment, a margin region means a region added to the outside (edges) of the main (center) region of an image in order to adjust a display aspect ratio of an image or video or to present additional information.

A representative example of a margin region is a black bar. Black bars are added in order to adjust the aspect ratio if the aspect ratio of the video itself and the aspect ratio of the display screen are different (an image added with a black bar in this way is called a letter box). While it is generally in a black color, it is not limited to a black color (in this specification, a bar not in a black color is also called a black bar).

FIG. 29 shows examples of images with black bars. As shown in FIG. 29, black bars are added to the outside (the patterns include top and bottom, right and left, four sides, and L shape) of the main (center) region (region showing a flower) of the image.

Other examples of margin regions include a data presenting region of an image for data broadcasting and the like, and L-shaped region in an image for L-shape broadcasting. It should be noted that margin regions are not limited to these regions if they are regions added to the outside of the main region of the image.

The (center) region serving as the main part of an image, without the margin regions, is called a main region in this embodiment.

Further, as information indicating a specified margin region (margin region information), it is possible to output information indicating margin regions respectively specified with respect to the first image and the second image which are the original images thereof. It is also possible to output information indicating a region where the margin region of the first image and the margin region of the second image overlap (overlapping region). Further, it is also possible to output information indicating the summed region of the margin regions of the first image and the margin regions of the second image (summed region).

The margin region information may be information identifying (a collection of) dimensions in which the extraction regions are included in the specified margin regions (for example, numbers specifying the dimensions). In this embodiment, a dimension in which the extraction region is included in the specified margin region means a dimension in which both or one of the two extraction regions are included in the specified margin region. Alternatively, information identifying (a collection of) dimensions in which extraction region is included in the region other than the specified margin region (that is, the main region) is also acceptable.

An exemplary method by which the margin region specifying unit 105 specifies the margin regions in the original images from which the first and second quantization index values for the respective dimensions (values of the respective dimensions of the quantization index vectors) are extracted (images from which the quantization index vectors are extracted) will be shown below.

In this method, a candidate region of a margin region (margin candidate region) is set beforehand, and a percentage of a dimension in which a quantization index value of a dimension, in which the extraction region is included in the set margin candidate region, is a quantization index value indicating “no difference” in region feature, is calculated. If this percentage is larger than a threshold, the set margin candidate region is determined to be a margin region. For example, if the quantization index is calculated based on Expression 2, among the dimensions in which the extraction regions are included in the set margin candidate region, if the percentage of the dimensions in which “quantization index is 0” is larger than a threshold, the set margin candidate region is specified as a margin region. This method utilizes a characteristic that there is no difference between region features (luminance values or the like) of two extraction regions in a margin region (particularly in a black bar) (for example, in a black bar, luminance values of the two extraction regions within the black bar region are the same). It should be noted that a dimension in which the extraction regions are included in the margin candidate regions means a dimension in which both extraction regions are included in the margin candidate regions.

Hereinafter, a specific example of the margin region determination unit 105, in the case where the feature vectors to be extracted are of 325 dimensions as described in the eighth embodiment, will be described.

First, margin candidate regions are set beforehand. For example, as margin candidate regions, (a) top and bottom black bars (horizontal black bars) and (b) right and left black bars (vertical black bars) in FIG. 29 are set. For the respective margin candidate regions, two stages of widths (narrow and wide) are set corresponding to the width of the black bars. Then, a collection of dimensions in which extraction regions are included in the set margin candidate regions is defined. In this example, the dimensions (113 dimensions in total) of the type shown in FIG. 25-a, included in the margin candidate region, will be the target. For example, the dimensions included in (a) top and bottom black bars (narrow), (a) top and bottom black bars (wide), (b) right and left black bars (narrow), and (b) right and left black bars (wide) are set as shown below (see FIG. 25-a).

The dimensions in which the extraction regions are included in (a) top and bottom black bars (narrow) are {1, 2, 3, 4, 17, 18, 19, 20, 45, 46, 47, 48, 61, 62, 63, 64}.

The dimensions in which the extraction regions are included in (a) top and bottom black bars (wide) are {1, 2, 3, 4, 17, 18, 19, 20, 45, 46, 47, 48, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 107, 108, 109, 110, 111, 112, 113}.

The dimensions in which the extraction regions are included in (b) right and left black bars (narrow) are {1, 5, 9, 13, 20, 24, 28, 32, 33, 37, 41, 45, 52, 56, 60, 64}.

The dimensions in which the extraction regions are included in (b) right and left black bars (wide) are {1, 5, 9, 13, 20, 24, 28, 32, 33, 37, 41, 45, 52, 56, 60, 64, 65, 71, 72, 78, 79, 85, 86, 92, 93, 99, 100, 106, 107, 113}.

Information of the dimensions included in the margin candidate regions set as described above is given to the margin region specifying unit 105 as an input.

From the supplied quantization index values (values of respective dimensions of quantization index vectors), the margin region calculation unit 105 calculates the percentage of dimensions in which the quantization index is 0 (no difference) among the dimensions in which the extraction dimensions are included in the margin candidate regions set as described above. For example, among 16 dimensions included in (a) top and bottom black bars (narrow), if the number of dimensions in which quantization index is 0 is 7 dimensions, it is 7/16. If this percentage is larger than a preset threshold, the set margin candidate regions are specified as margin regions of the original image from which the quantization index vector is extracted.

For example, it is assumed that a threshold is set to be 0.9. Then, if the percentages of the dimensions in which quantization index is 0 calculated with respect to the preset margin region candidates, namely, top and bottom black bars (narrow), top and bottom black bars (wide), right and left black bars (narrow), and right and left black bars (wide), respectively, are 16/16 (1.0), 20/30 (0.666), 5/16 (0.3125), and 10/30 (0.333), the margin candidate regions of the top and bottom black bars (wide) is specified as the margin regions (because the narrow one is included in the wide one). Further, it the respective percentages are 16/16 (1.0), 20/30 (0.666), 15/16 (0.9375), and 18/30 (0.6), the summed region of the two types of margin candidate regions, that is, top and bottom black bars (narrow) and right and left black bars (narrow) is specified as the margin regions. Furthermore, if the respective percentages are 1/16 (0.0625), 4/30 (0.1333), 5/16 (0.3125), and 10/30 (0.333), it is determined that there is no margin region.

The margin region specifying unit 105 performs the above processing to the supplied both first and second quantization index values (values of the respective dimensions of the quantization index vectors), and specifies the margin regions in the first images and the second images which are the original images from which they are extracted.

As information indicating margin regions (margin region information), it is possible to output information indicating margin regions specified with respect to the first image and the second image, respectively. For example, if the margin regions are specified to be top and bottom black bars (narrow) with respect to the first image and the margin regions are specified to be right and left black bars (wide) with respect to the second image, it is possible to output information indicating that the margin regions are top and bottom black bars (narrow) with respect to the first image (for example, index numbers indicating the margin candidate regions) and the margin regions are right and left black bars (wide) with respect to the second image. It is also possible to output information of an overlapping region or a summed region of the specified margin regions of the respective images.

As information indicating margin regions (margin region information), it is possible to output information indicating (a collection of) dimensions in which the extraction regions are included in the specified margin regions. For example, if the margin regions are specified to be top and bottom black bars (narrow) with respect to the first image and the margin regions are specified to be right and left black bars (wide) with respect to the second image, it is possible to output information indicating the dimensions {1, 2, 3, 4, 17, 18, 19, 20, 45, 46, 47, 48, 61, 62, 63, 64} with respect to the first image (e.g., a collection of the dimension numbers) and information indicating the dimensions {1, 5, 9, 13, 20, 24, 28, 32, 33, 37, 41, 45, 52, 56, 60, 64, 65, 71, 72, 78, 79, 85, 86, 92, 93, 99, 100, 106, 107, 113} with respect to the second image. It is also possible to output information indicating (a collection of) dimensions included in the overlapping region or the summed region of the specified margin regions of the respective images. It should be noted that although the dimensions (113 dimensions in total) of the type shown in FIG. 25-a included in the specified margin regions are shown as an exemplary output, it is also possible to output the dimensions of other types (FIGS. 25-b to 25-g) included in the specified margin regions, or it is also possible to output information indicating (a collection of) dimensions in which the extraction regions are included in the region other than the specified margin regions (that is, main region).

While in the above example of the margin region specifying unit 105 uses a percentage of the dimensions that “quantization index is 0” in which the extraction regions are included in the preset margin candidate regions, in a dimension in which extraction regions are included in both the inside and the outside (main region) of the margin candidate region (that is, one extraction region is present in a margin candidate region while is not present in the other margin candidate region), the margin region specifying unit 105 may calculate a percentage of the dimensions in which “quantization index is 0”, and if the percentage is larger than a threshold, specifies the margin candidate regions as the margin regions. This utilizes a characteristic that there is a difference in region feature between a margin region and the main region. Further, in the case of black bars, the luminance value of the margin region (black bar region) is small. As such, by utilizing the fact that a luminance value of the extraction region within the margin region is generally smaller than a luminance value of the extraction region in the main region, a percentage may be calculated while considering the signs of +1 and −1.

Further, it is possible to store typical quantization index values of the dimensions included in the margin candidate regions as a template, for example, determine similarity between the quantization index values for the respective dimensions (values of the respective dimensions of the quantization index vectors) to be supplied, and if the similarity is larger than a threshold, the margin candidate regions are specified as margin regions.

The method is not limited to the one described herein, and any methods may be used if the margin regions are specified from the quantization index values themselves of the respective dimensions to be supplied (values of the respective dimensions of the quantization index vectors).

The corrected scale calculation unit 106 calculates, from the first and second quantization index values of the respective dimensions (values of the respective dimensions of the quantization index vectors) output from the respective quantization value acquisition units 102 and 103, a scale indicating identity (similarity) of images by reducing the weight of dimensions in which extraction regions are included in the margin regions indicated by information representing the margin regions (margin region information) supplied from the margin region specifying unit 105, and outputs it as an identity scale.

In this embodiment, a dimension in which the extraction region is included in the margin region means a dimension in which both or one of the two extraction regions are included in the margin region.

If margin region information is supplied to each of the first image and the second image, it is preferable to obtain a region where the margin regions represented by the margin region information overlap (overlapping region) or the sum of the regions (summed region) so as to unify the margin regions.

Further, if the margin region information is information indicating (a collection of) dimensions in which the extraction regions are included in the margin region, the dimensions in which the extraction regions are included in the margin region are not limited to the dimensions included in the collection of dimensions supplied, but may be dimensions in which the extraction regions are included in the same margin regions. For example, in the case where the feature vectors to be extracted are of 325 dimensions described in the eighth embodiment, even if the margin region information limits that the dimensions are selected from the dimensions of the type shown in FIG. 25-a, if the extraction regions are included in the same margin regions in the dimensions included in other types shown in FIG. 25-b to 25-g, those dimensions may also be the targets of “dimensions in which the extraction regions are included in the margin regions”.

It should be noted that reducing the weight of the dimensions included in the margin regions provides the same value as that obtained by relatively increasing the weight of the dimensions not included in the margin regions, that is, the dimensions included in the main region, to calculate the identity scale. As such, it is possible to explicitly increase the weight of the dimensions not included in the margin regions (dimensions included in the main region) to calculate the identity scale.

Further, it is also possible to calculate the identity scale by setting 0 to the weight of the dimensions included in the margin regions. This means that it is possible to calculate the identity scale using only the dimensions not included in the margin regions (dimensions included in the main region) by eliminating the dimensions included in the margin regions. For example, it is possible to calculate the identity scale using only the dimensions in which no extraction region is included in the margin regions.

Further, regarding the corrected scale calculation unit 106, any method of calculating the identity scale may be used if it is a method of calculating an identity scale of images by decreasing the weight of the dimensions included in the margin regions. For example, it is possible to use a method of calculating an identity scale in which, from the first and second quantization index values of the respective dimensions (values of the respective dimensions of the quantization index vectors), corresponding dimensions are compared to obtain the number of dimensions in which quantization indexes coincide (similarity) or the number of dimensions in which quantization indexes do not coincide (Hamming distance). Further, it is also possible to use L1 distance or L2 distance (Euclidean distance) (if the quantization indexes are calculated based on Expression 2) or the like. Further, the methods of calculating an identity scale which have been described above may also be used.

It should be noted that if information indicating that there is no margin region is supplied as margin region information, it is only necessary to calculate an identity scale in a similar manner to that of the general scale calculation unit 104.

For example, it is possible to select the dimensions included in the main region by setting 0 to the weight of the dimensions included in the margin regions, that is, by eliminating the regions included in the margin regions, and using only the dimensions included in the main region, and calculate the number of dimensions in which quantization indexes coincide (similarity), the number of dimensions in which quantization indexes do not coincide (Hamming distance), L1 distance, or L2 distance, to thereby output it as an identity scale.

Further, if W1<W2 where a weight value of the dimensions included in the margin regions is W1 and a weight value of the dimensions not included in the margin regions (dimensions included in the main region) is W2, for example, it is possible to compare corresponding dimensions from the first and second quantization index values of the respective dimensions (values of the respective dimensions of the quantization index vectors), add the weight value of the dimension to the dimension in which quantization indexes coincide (that is, add W1 if quantization indexes of the dimension included in the margin regions coincide, add W2 if quantization indexes of the dimension not included in the margin regions coincide, and add 0 for the dimension in which quantization indexes do not coincide), to thereby calculate the identity scale as weighted similarity.

An example of the case where the dimensions {1, 2, 3, 4, 17, 18, 19, 20, 45, 46, 47, 48, 61, 62, 63, 64} corresponding to the top and bottom black bars (narrow) are supplied as margin region information, if the feature vectors to be extracted are of 325 dimensions as described in the eighth embodiment, will be given. In this case, it is possible to simply determine these dimensions {1, 2, 3, 4, 17, 18, 19, 20, 45, 46, 47, 48, 61, 62, 63, 64} (16 dimensions) to be the dimensions included in the margin regions and determine the other dimensions (325−16=309 dimensions) to be the dimensions not included in the margin regions (dimensions included in the main region). Further, as the margin regions correspond to the top and bottom black bars (narrow), all dimensions in which the extraction regions are included in the top and bottom black bars (narrow) may be determined to be the margin regions. For example, the dimensions in which any sub-regions of the extraction regions are included in the top and bottom black bars (narrow), that is, dimensions {114, 115, 116, 117, 126, 127, 128, 129}, may also be determined to be dimensions included in the margin regions. In that case, the other dimensions, that is, dimensions in which any extraction regions do not overlap the top and bottom black bars (narrow) is determined to be the dimensions not included in the margin regions (dimensions included in the main region).

With reference to the dimensions in which the extraction regions are included in the margin regions and the dimensions in which the extraction regions are not included in the margin regions (included in the main region), it is possible to calculate the number of dimensions in which quantization indexes coincide (similarity), the number of dimensions in which quantization indexes do not coincide (Hamming distance), L1 distance, or L2 distance, and output it as an identity scale. Further, if W1<W2 where a weight value of the dimensions included in the margin regions is W1 and a weight value of the dimensions not included in the margin regions (dimensions included in the main region) is W2, for example, it is possible to compare corresponding dimensions from the first and second quantization index values of the respective dimensions (values of the respective dimensions of the quantization index vectors), add the weight value of the dimension to the dimension in which quantization indexes coincide, to thereby calculate the identity scale as weighted similarity and output it.

[Effects of Second Embodiment of Matching Unit]

Advantageous effects of the second embodiment of the matching unit will be described.

In the second embodiment of the matching unit, as the margin region specifying unit 105 specifies the margin regions (black bars or the like) which are not related to identity determination, and the corrected scale calculation unit 106 calculates an identity scale by decreasing the weight of the dimensions included in the margin regions (in other words, calculating an identity scale by increasing the weight of the main region for identity determination), it is possible to calculate the identity scale with more accuracy. As such, identity can be determined with higher precision.

In particular, if matching is performed on different two images including margin regions such as black bars, the margin regions (black bars) are in common. As such, there has been a problem that the typical matching unit 100 may calculate the identity scale of images having different main regions to have a large value. However, as the second embodiment of the matching unit (matching unit 110) calculates the identity scale by decreasing the weight of the margin regions, such a problem will never be caused.

Further, in the second embodiment of the matching unit, as the margin region specifying unit 105 specifies the margin regions from the quantization index vectors themself, there is an advantageous effect that it is not necessary to separately specify the margin regions on the extraction side (extraction stage) of the image identifier. As such, there is an effect that no load (loads such as processing speed and mounting cost) is placed on the extraction side of the image identifier.

Further, the second embodiment of the matching unit (FIG. 28, matching unit 110) described above is able to connect to the embodiment of the matching unit shown in FIG. 20 (matching unit 100) to perform hierarchical matching. This means that, first, the matching unit 100 outputs a general identity scale (output of the scale calculation unit 104). The general identity scale output from the matching unit 100 is compared with a predetermined threshold, and if the identity scale is smaller than the threshold (degree of identity is small), the general identity scale is directly output. If the identity scale is larger than the threshold (degree of identity is large), then the matching unit 110 specifies margin regions, calculates a corrected identity scale by decreasing the weight of the dimensions included in the margin regions, and outputs it.

By performing hierarchical matching by the matching unit 100 and the matching unit 110 as described above, as a corrected identity scale is calculated by the matching unit 110 only when the general identity scale calculated by the matching unit 100 is large, there is an advantageous effect that processing speed of the matching can be higher. Generally, when performing identity determination in a database including a large number of different images, general identity scales calculated by the matching unit 100 are smaller than a threshold in most cases. Accordingly, as the processing often ends by the matching unit 100, the processing speed can be higher significantly.

[Third Embodiment of Matching Unit]

Next, a third embodiment of a matching unit for matching quantization index vectors output in the present invention will be described using a block diagram.

Referring to FIG. 36 showing a block diagram of a matching unit 200 for matching quantization index vectors output in the present invention, the matching unit 200 includes a code determination unit 201, code value acquisition units 202 and 203, and a scale calculation unit 204.

The code determination unit 201 is connected to the code value acquisition units 202 and 203, and outputs determined code designation information. The code value acquisition unit 202 acquires, from a first quantization index vector, a value of a code designated by code designation information input from the code determination unit 201, and outputs the value to the scale calculation unit 204 as a first code value. The code value acquisition unit 203 acquires, from a second quantization index vector, a value of a code designated by the code designation information input from the code determination unit 201, and outputs the value to the scale calculation unit 204 as a second quantization index value. The scale calculation unit 204 calculates the scale indicating the identity from the first and second code values respectively output from the code value acquisition unit 202 and 203, and outputs it.

Next, operation of the matching unit 200 shown in FIG. 36 will be described.

First, to the matching unit 200, a first encoded quantization index vector which is a vector generated by encoding the quantization index vector extracted from a first image, and a second encoded quantization index vector which is a vector generated by encoding the quantization index vector extracted from a second image, are input. It should be noted that an encoded quantization index vector is a code string obtained by collectively encoding quantization index values of a quantization index vector for a plurality of dimensions. As described in paragraph (K), when the features of the respective dimensions of a feature vector are quantized in three values and are collectively encoded by 5 dimensions, one code is generated for each five dimensions. As such, if the number of dimensions of a feature vector is N, N/5 pieces of codes are generated. In that case, an encoded quantization index vector is a code string consisting of N/5 pieces of codes.

The input first and second encoded quantization index vectors are respectively input to the code value acquisition units 202 and 203.

To the code value acquisition units 202 and 203, the code designation information output from the code determination unit 201 is also input. The code determination unit 201 sequentially outputs information designating respective codes in the code string. If the number of codes in the code string is M (in the above example, M=N/5), the output order is not necessary incremented by one from 1 to M, and may be in any order if all values from 1 to M are designated without deficiency and excess.

The code value acquisition units 202 and 203 acquire, from the input encoded quantization index vectors, the values of the code designated in the code designation information output from the code determination unit 101, and output the acquired code values to the scale calculation unit 204.

The scale calculation unit 204 compares the first code value with the second code value, which are output from the code value acquisition unit 201 and 202. In this process, the code values are directly compared, without being decoded to the quantization index values. As described in paragraphs (N)-(P), a lookup table is prepared with which a similarity between the two code values can be obtained, and the identity scale is calculated in code units with use of this table. This process is performed on the respective codes, whereby a similarity scale (or distance scale) between the first and second code values is calculated as an identity scale.

The acquired identity scale value is compared with a predetermined threshold to determine the identity. If the identity scale is a scale indicating a similarity, they are determined to be identical if the scale value is equal to or larger than the threshold. On the other hand, if the identity scale is a scale indicating a distance, they are determined to be identical if the scale value is smaller than or equal to the threshold.

Next, operation of the matching unit 200 shown in FIG. 36 will be described using a flowchart. First, operation in the case of using a similarity as an identity scale will be described.

FIG. 37 is a flowchart showing the operation of the matching unit 200. In the flowchart of FIG. 37, a code number of the encoded quantization index vector is indicated by “m”, and there are M dimensions in total from 1 to M. Further, a variable for calculating the similarity is indicated by B.

First, the code determination unit 201 determines to acquire a first code (m=1) as the first code of the encoded quantization index vector to be matched, and supplies it to the code value acquisition units 202 and 203 and sets the variable B to be 0 in the scale calculation unit 204 (step S600).

Then, the code value acquisition units 202 and 203 acquire the m^(th) first code value and second code value from the first quantization index vector and the second quantization index vector, and supply them to the scale calculation unit 204 (step S602).

Then, the scale calculation unit 204 calculates, from the first code value and the second code value, a similarity ΔB between the features of the plurality of dimensions corresponding to the respective code values, with reference to the lookup table described in paragraphs (N)-(P) (step S604).

Next, the value of ΔB is added to the variable B (step S106). At this point, if the value of ΔB is 0, it is possible to control not to add, rather than adding 0 to the variable B.

Next, it is checked whether the code number m reaches the number of codes M (step S608), and if the number does not reach, the processing moves to step S612, while if the number reached, the value of the variable B at that point is output as an identity scale (scale indicating similarity) (step S110) and the processing ends.

At step 612, the code determination unit 201 determines the next code number from m=m+1 as the dimension for acquiring quantization indexes, and supplies it to the code value acquisition units 202 and 203 as code designation information. Then, the processing returns to step S602.

It should be noted that although the extraction processing is performed in order from the code number m to the dimension M, any order may be taken without being limited to this order. Further, although the description has been given for the case of calculating the similarity, it is also possible to calculate a distance scale as an identity scale in a similar manner. In that case, a lookup table is adapted to store distance scales, rather than similarities.

FIG. 38 is another flowchart showing the operation of the matching unit 200. Also in the flowchart of FIG. 38, a code number of an encoded quantization index vector is indicated by “m”, and there are M dimensions in total from 1 to M. Further, a variable for calculating the similarity is indicated by B, and a variable for counting the dimensions in which not “both quantization indexes are 0” is indicated by A.

First, the code determination unit 201 determines to acquire a first code (n=1) as the first code of the encoded quantization index vector to be matched, and supplies it to the code value acquisition units 202 and 203, and sets the variables A and B to be 0 in the scale calculation unit 204 (step S700), and then moves to step S602.

Step S602 is the same as the case of FIG. 37, and when the step ends, the processing moves to step S714.

At step S714, the scale calculation unit 204 checks the number of dimensions in which not “both values are 0” within the dimensions of the feature vectors corresponding to the code value, from the first code value and the second code value. This value is set to ΔA. This is also calculated using the lookup table describing the relations between the code values and ΔA, as described in paragraph (P).

Then, the value of ΔA is added to the variable A (step S716). At this point, if the value of ΔA is 0, it is possible to control not to add, rather than adding 0 to the variable A.

The processing at steps S604, S106, S608, and S612 is the same as that in the case of FIG. 37. If the code number m reached the number of codes M at step S608, the processing moves to step S310.

At step S310, the scale calculation unit 204 calculates the value of B/A and outputs it as an identity scale, and ends the processing. However, if A=0, the scale calculation unit 204 outputs a predetermined value (e.g., 0.5).

It should be noted that although the extraction processing is performed in order from the code number m to M, any order may be taken without being limited to this order. Further, although the description has been given for the case of calculating the similarity, it is also possible to calculate a distance scale as an identity scale in a similar manner. In that case, a lookup table is adapted to store distance scales, rather than similarities.

While the embodiments of the present invention have been described above, the present invention is not limited to these examples, and various additions and modifications may be made therein. Further, the image signature extraction device and the matching device of the present invention are adapted such that the functions thereof can be realized by computers and programs, as well as hardware. Such programs are provided in the form of being written on a computer readable recording medium such as a magnetic disk, a semiconductor memory, or the like, are read by a computer when the computer is started for example, and controls operation of the computer, to thereby allow the computer to function as the image signature extraction device and the matching device of the above-described embodiments.

This application is based upon and claims the benefit of priority from Japanese patent applications No. 2009-143352, filed on Jun. 16, 2009, and No. 2009-149893, filed on Jun. 24, 2009, the disclosures of which are incorporated herein in their entirety by reference.

REFERENCE NUMERALS

-   1 dimension determination unit -   2 extraction region acquisition unit -   3, 3A region feature calculation unit -   31, 31A first region feature calculation unit -   32, 32A second region feature calculation unit -   4, 4B comparison unit -   41 magnitude comparison unit -   42, 44 quantization unit -   43 difference value calculation unit -   45 quantization boundary determination unit -   5 region feature calculation method acquisition unit -   6 comparison method acquisition unit -   7 encoding unit -   100, 110, 200 matching unit -   101 dimension determination unit -   102, 103 quantization value acquisition unit -   104, 204 scale calculation unit -   105 margin region specifying unit -   106 corrected scale calculation unit -   201 code determination unit -   202, 203 code value acquisition unit 

1. An image signature matching device, comprising: a margin region specifying unit for specifying, from an image signature of a first image and an image signature of a second image, a margin region of each of the images, wherein the image signature of the first image and the image signature of the second image are generated by a generation method including: extracting region features from respective sub-regions of a plurality of pairs of sub-regions in an image; for each of the pairs of sub-regions, quantizing a difference value between the region features of two sub-regions forming a pair; and generating a collection of elements which are quantization values calculated for the respective pairs of sub-regions as an image signature to be used for discriminating the image, and a matching unit for matching the image signature of the first image and the image signature of the second image in such a manner that a weight of an element, in which at least one of two sub-regions forming a pair is included in the specified margin region, is reduced.
 2. The image signature matching device, according to claim 1, wherein the margin region specifying unit specifies a margin region of each of the images from one or more candidate regions of the margin region.
 3. The image signature matching device, according to claim 1, wherein the margin region specifying unit specifies a margin region of each of the images from one or more candidate regions of the margin region, based on quantization values of the elements in which at least one of two sub-regions forming a pair is included in the candidate regions.
 4. The image signature matching device, according to claim 1, wherein the margin region specifying unit specifies a margin region of each of the images from one or more candidate regions of the margin region, based on a result of comparing quantization values of the elements, in which at least one of two sub-regions forming a pair is included in the candidate regions, with a predetermined value.
 5. The image signature matching device, according to claim 1, wherein the margin region specifying unit specifies a margin region of each of the images from one or more candidate regions of the margin region, based on a result of comparing quantization values of the elements, in which at least one of two sub-regions forming a pair is included in the candidate regions, with a predetermined value, and comparing a percentage of coincident elements with a threshold.
 6. The image signature matching device, according to claim 1, wherein the margin region specifying unit specifies a margin region of each of the images from one or more candidate regions of the margin region, based on a result of comparing quantization values of the elements, in which at least one of two sub-regions forming a pair is included in the candidate regions, with a predetermined value, and comparing a percentage of non-coincident elements with a threshold.
 7. The image signature matching device, according to claim 1, wherein the margin region specifying unit specifies a margin region of each of the images from one or more candidate regions of the margin region, based on a result of comparing quantization values of elements, in which both of two sub-regions forming a pair are included in the candidate regions, with a quantization value which is obtained if an absolute value of the difference value is smaller than a prescribed value, and comparing a percentage of coincident elements with a threshold.
 8. The image signature matching device, according to claim 1, wherein the margin region specifying unit specifies a margin region of each of the images from one or more candidate regions of the margin region, based on a result of comparing quantization values of elements, in which both of two sub-regions forming a pair are included in the candidate regions, with a quantization value which is obtained if an absolute value of the difference value is smaller than a prescribed value, and comparing a percentage of non-coincident elements with a threshold.
 9. The image signature matching device, according to claim 1, wherein the margin region is a region outside an image.
 10. The image signature matching device, according to claim 1, wherein the matching unit matches the image signature of the first image and the image signature of the second image by eliminating an element in which at least one of two sub-regions forming a pair is included in the specified margin region.
 11. The image signature matching device, according to claim 1, wherein the matching unit compares corresponding elements of the image signature of the first image and the image signature of the second image, and calculates an identity scale indicating a degree that the first image and the second image are identical.
 12. The image signature matching device, according to claim 1, wherein the plurality of pairs of sub-regions include at least one pair of sub-regions in which both a combination of shapes of two sub-regions of the pair and a relative positional relation between the two sub-regions of the pair differ from those of at least one of other pairs of sub-regions.
 13. An image signature matching method, comprising: specifying, from an image signature of a first image and an image signature of a second image, a margin region of each of the images, wherein the image signature of the first image and the image signature of the second image are generated by a generation method including: extracting region features from respective sub-regions of a plurality of pairs of sub-regions in an image; for each of the pairs of sub-regions, quantizing a difference value between the region features of two sub-regions forming a pair; and generating a collection of elements which are quantization values calculated for the respective pairs of sub-regions as an image signature to be used for discriminating the image, and matching the image signature of the first image and the image signature of the second image in such a manner that a weight of an element, in which at least one of two sub-regions forming a pair is included in the specified margin region, is reduced.
 14. The image signature matching method, according to claim 13, wherein the specifying the margin region includes specifying a margin region of each of the images from one or more candidate regions of the margin region.
 15. The image signature matching method, according to claim 13, wherein the specifying the margin region includes specifying a margin region of each of the images from one or more candidate regions of the margin region, based on quantization values of the elements in which at least one of two sub-regions forming a pair is included in the candidate regions.
 16. The image signature matching method, according to claim 13, wherein the specifying the margin region includes specifying a margin region of each of the images from one or more candidate regions of the margin region, based on a result of comparing quantization values of the elements, in which at least one of two sub-regions forming a pair is included in the candidate regions, with a predetermined value.
 17. The image signature matching method, according to claim 13, wherein the specifying the margin region includes specifying a margin region of each of the images from one or more candidate regions of the margin region, based on a result of comparing quantization values of the elements, in which at least one of two sub-regions forming a pair is included in the candidate regions, with a predetermined value, and comparing a percentage of coincident elements with a threshold.
 18. The image signature matching method, according to claim 13, wherein the specifying the margin region includes specifying a margin region of each of the images from one or more candidate regions of the margin region, based on a result of comparing quantization values of the elements, in which at least one of two sub-regions forming a pair is included in the candidate regions, with a predetermined value, and comparing a percentage of non-coincident elements with a threshold.
 19. The image signature matching method, according to claim 13, wherein the specifying the margin region includes specifying a margin region of each of the images from one or more candidate regions of the margin region, based on a result of comparing quantization values of elements, in which both of two sub-regions forming a pair are included in the candidate regions, with a quantization value which is obtained if an absolute value of the difference value is smaller than a prescribed value, and comparing a percentage of coincident elements with a threshold.
 20. The image signature matching method, according to claim 13, wherein the specifying the margin region includes specifying a margin region of each of the images from one or more candidate regions of the margin region, based on a result of comparing quantization values of elements, in which both of two sub-regions forming a pair are included in the candidate regions, with a quantization value which is obtained if an absolute value of the difference value is smaller than a prescribed value, and comparing a percentage of non-coincident elements with a threshold.
 21. The image signature matching method, according to claim 13, wherein the margin region is a region outside an image.
 22. The image signature matching method, according to claim 13, wherein the matching includes matching the image signature of the first image and the image signature of the second image by eliminating an element in which at least one of two sub-regions forming a pair is included in the specified margin region.
 23. The image signature matching method, according to claim 13, wherein the matching includes comparing corresponding elements of the image signature of the first image and the image signature of the second image, and calculating an identity scale indicating a degree that the first image and the second image are identical.
 24. The image signature matching method, according to claim 13, wherein the plurality of pairs of sub-regions include at least one pair of sub-regions in which both a combination of shapes of two sub-regions of the pair and a relative positional relation between the two sub-regions of the pair differ from those of at least one of other pairs of sub-regions.
 25. A computer-readable memory storing a program for causing a computer to function as: a margin region specifying unit for specifying, from an image signature of a first image and an image signature of a second image, a margin region of each of the images, wherein the image signature of the first image and the image signature of the second image are generated by a generation method including: extracting region features from respective sub-regions of a plurality of pairs of sub-regions in an image; for each of the pairs of sub-regions, quantizing a difference value between the region features of two sub-regions forming a pair; and generating a collection of elements which are quantization values calculated for the respective pairs of sub-regions as an image signature to be used for discriminating the image, and a matching unit for matching the image signature of the first image and the image signature of the second image in such a manner that a weight of an element, in which at least one of two sub-regions forming a pair is included in the specified margin region, is reduced. 